The Community for Technology Leaders
Green Image
Application layer peer to peer (P2P) networks are considered to be the most important development for next generation Internet infra-structure. For these systems to be effective, load balancing among the peers is critical. Most structured P2P systems rely on ID-space partitioning schemes to solve the load imbalance problem, and has been known to result in an imbalance factor of &#x0398;(log <em>N</em>) in the zone sizes. This paper makes two contributions. First, we propose to address the virtual server-based load balancing problem systematically using an optimization based approach, and derived an effective algorithm to re-arrange loads among the peers. We demonstrate the superior performance of our proposal in general, and its advantages over previous strategies in particular. We also explore other important issues vital to the performance in the virtual server framework, such as the effect of the number of directories employed in the system, and the performance ramification of user registration strategies. Secondly, and perhaps more significantly, we characterize systematically the effect of heterogeneity on load balancing algorithm performance, and the conditions in which heterogeneity may be easy or hard to deal with based on extensive study of a wide spectrum of load and capacity scenarios.
distributed hash table, load balance, local search, structured peer-to-peer system, generalized assignment problem

C. Chen and K. Tsai, "The Server Reassignment Problem for Load Balancing in Structured P2P Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 19, no. , pp. 234-246, 2007.
89 ms
(Ver 3.3 (11022016))