7133 search results - page 68 / 1427 » Communication algorithms with advice |
INFOCOM
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper concerns the design of distributed algorithms for sharing network bandwidth resources among contending flows. The classical fairness notion is the so-called max
INFOCOM
1999
IEEE
14 years 1 months ago
1999
IEEE
A key functionality in today's widely used interior gateway routing protocols such as OSPF and IS
COCO
2009
Springer
14 years 3 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
INFOCOM
1995
IEEE
14 years 11 days ago
1995
IEEE
In this work we suggest an algorithm that increases the reservation success probability for bursty tra c in high speed networks by adding exibility to the construction of the rout...
JDA
2008
13 years 8 months ago
2008
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...