Load Balancing White Papers
Load Balancing in Dynamic Structured P2P Systems
Overview This paper proposes an algorithm for load balancing in such heterogeneous, dynamic P2P systems. This simulation results show that in the face of rapid arrivals and departures of objects of widely varying load, this algorithm achieves load balancing for system utilizations as high as 90% while moving only about 8% of the load that arrives into the system. Similarly, in a dynamic system where nodes arrive and depart, this algorithm moves less than 60% of the load the underlying DHT moves due to node arrivals and departures. Finally, the paper show that the distributed algorithm performs only negligibly worse than a similar centralized algorithm, and that node heterogeneity helps, not hurts, the scalability of the algorithm.
| Publisher | University of California | File Format | |
|---|---|---|---|
| Date Published | January 2008 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful? 1 out of 2 users found this white paper useful
White Paper RSS
Download
Register
