1639 search results - page 41 / 328 » Degree-constrained network flows |
ICALP
2009
Springer
14 years 2 months ago
2009
Springer
Intuitively, Braess's paradox states that destroying a part of a network may improve the common latency of selfish flows at Nash equilibrium. Such a paradox is a pervasive phe...
CN
1999
13 years 10 months ago
1999
Consider a network of computers interconnected by point-to-point communication channels. For each flow of packets through the network, the network reserves a fraction of the packe...
APNOMS
2006
Springer
14 years 2 months ago
2006
Springer
To provide scheduling in wireless ad hoc networks, that is both highly efficient and fair in resource allocation, is not a trivial task because of the unique problems in wireless n...
TON
2008
13 years 11 months ago
2008
Abstract-- It is very important to allocate and manage resources for multimedia traffic flows with real-time performance requirements in order to guarantee quality-of-service (QoS)...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
In this work we study the asymptotic traffic behaviour for Gromov's hyperbolic networks as the size of the network increases. We prove that under certain mild hypothesis the t...