The Server Reassignment Problem for Load Balancing in Structured Peer to Peer Systems
Application-layer Peer-To-Peer (P2P) networks are considered to be the path break in the Internet infrastructure. Load balancing among the peers is critical for these systems to be effective. Most structured P2P systems rely on ID-space partitioning schemes to solve the load imbalance problem. The authors' focus is on an important issue 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. They systematically characterize the effect of heterogeneity on load balancing algorithm called as Dual-Space Local-Search (DSLS) and the conditions in which heterogeneity may be easy or hard to deal with based on an extensive study of a wide spectrum of load and capacity scenarios.