1325 search results - page 29 / 265 » Quasirandom Load Balancing |
GLOBECOM
2008
IEEE
13 years 7 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...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
The need for high performance and throughput Question Answering (QA) systems demands for their migration to distributed environments. However, even in such cases it is necessary t...
EUROPAR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We investigate the following very simple load-balancing algorithm on the N-cycle (N even) which we call Odd-Even Transposition Balancing (OETB). The edges of the cycle ar...
ICCCN
2008
IEEE
14 years 2 months ago
2008
IEEE
— Internet service providers have to provision network resources to optimize bandwidth utilization. Dynamic routing protocols take traffic variations into account to control the...
SASO
2008
IEEE
14 years 1 months ago
2008
IEEE
Distributed Hash Tables (DHT) with order-preserving hash functions require load balancing to ensure an even item-load over all nodes. While previous item-balancing algorithms only...