Load balancing in dynamic structured peer-to-peer systems Export

@article{Surana2006, abstract = {Most P2P systems that provide a DHT abstraction distribute objects randomly among "peer nodes" in a way that results in some nodes having [Theta](log N) times as many objects as the average node. Further imbalance may result due to nonuniform distribution of objects in the identifier space and a high degree of heterogeneity in object loads and node capacities. Additionally, a node's load may vary greatly over time since the system can experience continuous insertions and deletions of objects, skewed object arrival patterns, and continuous arrival and departure of nodes.In this paper, we propose an algorithm for load balancing in such heterogeneous, dynamic P2P systems. Our simulation results show that in the face of rapid arrivals and departures of objects of widely varying load, our algorithm improves load balance by more than an order of magnitude for system utilizations as high as 80\% while incurring an overhead of only about 6\%. We also show that our distributed algorithm performs only negligibly worse than a similar centralized algorithm, and that node heterogeneity helps, not hurts, the scalability of our algorithm. Although many of these results are dependent on the workload, we believe the efficiency and performance improvement demonstrated over the case of no load balancing shows that our technique holds promise for deployed systems.}, author = {Surana, S. and Godfrey, B. and Lakshminarayanan, K. and Karp, R. and Stoica, I.}, booktitle = {P2P Computing Systems}, citeulike-article-id = {705055}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.peva.2005.01.003}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6V13-4FJGW2F-2/2/320e7e21d7c9a58c3e26546091c4a93c}, doi = {10.1016/j.peva.2005.01.003}, journal = {Performance Evaluation}, keywords = {balancing, ecs256, load, p2p}, month = {March}, number = {3}, pages = {217--240}, posted-at = {2007-10-09 02:59:34}, priority = {4}, title = {Load balancing in dynamic structured peer-to-peer systems}, url = {http://dx.doi.org/10.1016/j.peva.2005.01.003}, volume = {63}, year = {2006} }

TY - JOUR ID - Surana2006 L3 - citeulike-article-id:705055 N2 - Most P2P systems that provide a DHT abstraction distribute objects randomly among "peer nodes" in a way that results in some nodes having [Theta](log N) times as many objects as the average node. Further imbalance may result due to nonuniform distribution of objects in the identifier space and a high degree of heterogeneity in object loads and node capacities. Additionally, a node's load may vary greatly over time since the system can experience continuous insertions and deletions of objects, skewed object arrival patterns, and continuous arrival and departure of nodes.In this paper, we propose an algorithm for load balancing in such heterogeneous, dynamic P2P systems. Our simulation results show that in the face of rapid arrivals and departures of objects of widely varying load, our algorithm improves load balance by more than an order of magnitude for system utilizations as high as 80% while incurring an overhead of only about 6%. We also show that our distributed algorithm performs only negligibly worse than a similar centralized algorithm, and that node heterogeneity helps, not hurts, the scalability of our algorithm. Although many of these results are dependent on the workload, we believe the efficiency and performance improvement demonstrated over the case of no load balancing shows that our technique holds promise for deployed systems. IS - 3 JF - Performance Evaluation EP - 240 TI - Load balancing in dynamic structured peer-to-peer systems VL - 63 T2 - P2P Computing Systems SP - 217 KW - balancing KW - ecs256 KW - load KW - p2p AU - Surana, S AU - Godfrey, B AU - Lakshminarayanan, K AU - Karp, R AU - Stoica, I PY - 2006/03// UR - http://dx.doi.org/10.1016/j.peva.2005.01.003 ER -