93 search results - page 3 / 19 » Dynamic load balancing without packet reordering |
GLOBECOM
2008
IEEE
13 years 5 months ago
2008
IEEE
Traditional hop-by-hop dynamic routing makes inefficient use of network resources as it forwards packets along already congested shortest paths while uncongested longer paths may b...
INFOCOM
2003
IEEE
13 years 10 months ago
2003
IEEE
— In this paper, we propose two schemes for the load balanced Birkhoff-von Neumann switches to provide guaranteed rate services. As in [7], the first scheme is based on an Earli...
ICNP
2003
IEEE
13 years 10 months ago
2003
IEEE
TCP performs poorly on paths that reorder packets significantly, where it misinterprets out-of-order delivery as packet loss. The sender responds with a fast retransmit though no...
ANSS
2000
IEEE
13 years 9 months ago
2000
IEEE
We present, in this paper, an algorithm which integrates flow control and dynamic load balancing in Time Warp. The algorithm is intended for use in a distributed memory environme...
CCGRID
2003
IEEE
13 years 10 months ago
2003
IEEE
Increasingly large-scale clusters of PC/WS continue to become majority platform in HPC field. Such a commodity cluster environment, there may be incremental upgrade due to severa...