Sciweavers

1127 search results - page 40 / 226
» New Algorithms for Generalized Network Flows
Sort
View
ARVLSI
1995
IEEE
155views VLSI» more  ARVLSI 1995»
15 years 1 months ago
Low-latency plesiochronous data retiming
A new method of retiming plesiochronous data is described. This method features latency of less than a cell-time and requires only minimal support circuitry. No flow control or ha...
Larry R. Dennison, William J. Dally, Thucydides Xa...
ICC
2007
IEEE
15 years 4 months ago
A Support System for Designing Ubiquitous Service Composition Scenarios
—Ubiquitous service composition provides new services and applications seamlessly by establishing cooperation among any devices in home networks and any services in service provi...
Takaaki Moriya, Hiroyuki Ohnishi, Makoto Yoshida, ...
IPPS
2010
IEEE
14 years 8 months ago
Stability of a localized and greedy routing algorithm
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
Christelle Caillouet, Florian Huc, Nicolas Nisse, ...
INFOCOM
1998
IEEE
15 years 2 months ago
Loop-Free Multipath Routing Using Generalized Diffusing Computations
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...
William T. Zaumen, J. J. Garcia-Luna-Aceves
HSNMC
2004
Springer
126views Multimedia» more  HSNMC 2004»
15 years 3 months ago
Hybrid Unicast and Multicast Flow Control: A Linear Optimization Approach
— In this paper, we present a solution to the general problem of flow control for both unicast and multicast IP networks. We formulate a convex optimization problem that can be ...
Homayoun Yousefi'zadeh, Fatemeh Fazel, Hamid Jafar...