167 search results - page 7 / 34 » Queuing Delays in Randomized Load Balanced Networks |
119
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
110
Voted
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
—A foreseeable scenario is where on the Internet Mobile IPv6 is deployed and a large percentage of the clients are mobile nodes. These mobile clients will communicate with large ...
138
click to vote
ITCC
2005
IEEE
15 years 9 months ago
2005
IEEE
— Ad hoc wireless networks are growing in popularity and usefulness, however they rely on broadcasting as a fundamental process for routing. Improvements to broadcasting have mad...
138
click to vote
ICNP
1997
IEEE
15 years 8 months ago
1997
IEEE
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
159
click to vote
INFORMATICALT
2006
15 years 4 months ago
2006
Abstract. Several best effort schemes (next-hop routing) are used to transport the data in the Internet. Some of them do not perform flexible route computations to cope up with the...