02-05-2011, 10:33 AM
The Server Reassignment Problem for Load Balancing in Structured P2P Systems-IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 19, NO. 2, F
vb.net
Abstract—
Application-layer peer-to-peer (P2P) networks are considered to be the most important development for next-generation Internet infrastructure. 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 have been known to result in an imbalance factor of 0(logN)Þ in the zone sizes. This paper makes two contributions. First, we propose addressing the virtual-server-based load balancing problem systematically using an optimization-based approach and derive an effective algorithm to rearrange 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. Second, and perhaps more significantly, we
systematically characterize 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 an extensive study of a wide spectrum of load and capacity scenarios.
vb.net
Abstract—
Application-layer peer-to-peer (P2P) networks are considered to be the most important development for next-generation Internet infrastructure. 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 have been known to result in an imbalance factor of 0(logN)Þ in the zone sizes. This paper makes two contributions. First, we propose addressing the virtual-server-based load balancing problem systematically using an optimization-based approach and derive an effective algorithm to rearrange 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. Second, and perhaps more significantly, we
systematically characterize 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 an extensive study of a wide spectrum of load and capacity scenarios.