The Community for Technology Leaders
RSS Icon
Issue No.04 - April (2009 vol.21)
pp: 595-608
Quang Hieu Vu , National University of Singapore, Singapore
Beng Chin Ooi , National University of Singapore, Singapore
Martin Rinard , Massachusetts Institute of Technology, Cambridge
Kian-Lee Tan , National University of Singapore, Singapore
Over the pass few years, peer-to-peer (P2P) systems have rapidly grown in popularity and become a dominant means for sharing resources. In these systems, load balancing is a key challenge because nodes are often heterogeneous. While several load balancing schemes have been proposed in the literature, these solutions are typically ad-hoc, heuristic-based and localized. In this paper, we present a general framework, HiGLOB, for global load balancing in structured P2P systems. Each node in HiGLOB has two key components: (1) A histogram manager maintains a histogram that reflects a global view of the distribution of the load in the system, and (2) A load-balancing manager that redistributes the load whenever the node becomes over or under loaded. We exploit the routing metadata to partition the P2P network into non-overlapping regions corresponding to the histogram buckets. We propose mechanisms to keep the cost of constructing and maintaining the histograms low. We further show that our scheme can control and bound the amount of load imbalance across the system. Finally, we demonstrate the effectiveness of HiGLOB by instantiating it over three existing structured P2P systems: Chord, Skip Graph and BATON. Our experimental results indicate that our approach works well in practice.
Peer-to-Peer, Framework, Load Balancing, Histogram, DHT, Overlay Network
Quang Hieu Vu, Beng Chin Ooi, Martin Rinard, Kian-Lee Tan, "Histogram-Based Global Load Balancing in Structured Peer-to-Peer Systems", IEEE Transactions on Knowledge & Data Engineering, vol.21, no. 4, pp. 595-608, April 2009, doi:10.1109/TKDE.2008.182
[1] S3: Scalable, Shareable and Secure P2P Based Data Management System,, 2008.
[2] Gnutella, http:/, 2008.
[3] BitTorrent, http:/, 2008.
[4] Overnet, http:/, 2008.
[5] SETI@home, http:/, 2008.
[6] Groove, http:/, 2008.
[7] Skype, http:/, 2008.
[8] A. Madhukar and C. Williamson, “A Longitudinal Study of P2P Traffic Classification,” Proc. Int'l Symp. Modeling, Analysis, and Simulation of Computer and Telecomm. Systems (MASCOTS), 2006.
[9] D. Karger, F. Kaashoek, I. Stoica, R. Morris, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. SIGCOMM '01, pp. 149-160, 2001.
[10] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “AScalable Content Addressable Network,” Proc. SIGCOMM '01, pp. 161-172, 2001.
[11] B.Y. Zhao, J.D. Kubiatowicz, and A.D. Joseph, “Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing,” Technical Report CSD-01-1141, Univ. of California, Apr. 2001.
[12] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. 18th IFIP/ACM Int'l Conf. Distributed Systems Platforms (Middleware '01), pp. 329-350, 2001.
[13] K. Aberer, “P-Grid: A Self-Organizing Access Structure for P2P Information Systems,” Proc. Int'l Conf. Cooperative Information Systems (CoopIS), 2001.
[14] R. Huebsch, B. Chun, J.M. Hellerstein, B.T. Loo, P. Maniatis, T. Roscoe, S. Shenker, I. Stoica, and A.R. Yumerefendi, “The Architecture of PIER: An Internet-Scale Query Processor,” Proc. Conf. Innovative Data Systems Research (CIDR), 2005.
[15] H.V. Jagadish, B.C. Ooi, and Q.H. Vu, “Baton: A Balanced Tree Structure for Peer-to-Peer Networks,” Proc. Very Large Databases Conf. (VLDB '05), pp. 661-672, 2005.
[16] S. Saroiu, P.K. Gummadi, and S.D. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” Proc. Multimedia Computing and Networking Conf. (MMCN), 2002.
[17] M. Mitzenmacher, “The Power of Two Choices in Randomized Load Balancing,” IEEE Trans. Parallel and Distributed System, vol. 12, no. 10, pp. 1094-1104, Oct. 2001.
[18] A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, “Load Balancing in Structured P2P Systems,” Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS), 2003.
[19] D. Karger and M. Ruhl, “Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems,” Proc. ACM Symp. Parallelism in Algorithms and Architectures (SPAA), 2004.
[20] P. Ganesan, M. Bawa, and H. Garcia-Molina, “Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems,” Proc. Very Large Databases Conf. (VLDB '04), pp. 444-455, 2004.
[21] J. Aspnes and G. Shah, “Skip Graphs,” Proc. 14th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '03), pp. 384-393, 2003.
[22] D. Karger and M. Ruhl, “Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems,” Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS), 2004.
[23] B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, “Load Balancing in Dynamic Structured P2P Systems,” Proc. INFOCOM, 2004.
[24] K. Kenthapadi and G.S. Manku, “Decentralized Algorithms Using Both Local and Random Probes for P2P Load Balancing,” Proc. ACM Symp. Parallelism in Algorithms and Architectures (SPAA), 2005.
[25] G. Giakkoupis and V. Hadzilacos, “A Scheme for Load Balancing in Heterogenous Distributed Hash Tables,” Proc. ACM Symp. Principles of Distributed Computing Conf. (PODC), 2005.
[26] J. Ledlie and M. Seltzer, “Distributed, Secure Load Balancing with Skew, Heterogeneity, and Churn,” Proc. INFOCOM, 2005.
[27] S. Surana, B. Godfrey, K. Lakshminarayanan, R. Karp, and I. Stoica, “Load Balancing in Dynamic Structured P2P Systems,” Performance Evaluation, vol. 63, no. 6, pp. 217-240, 2006.
[28] M. Adler, E. Halperin, R.M. Karp, and V.V. Vazirani, “A Stochastic Process on the Hypercube with Applications to Peer-to-Peer Networks,” Proc. 35th ACM Symp. Theory of Computing (STOC '03), pp. 575-584, 2003.
[29] K. Aberer, A. Datta, and M. Hauswirth, “Multifaceted Simultaneous Load Balancing in DHT-Based P2P Systems: A New Game with Old Balls and Bins,” Self-* Properties in Complex Information Systems, 2005.
[30] A.R. Bharambe, M. Agrawal, and S. Seshan, “Mercury: Supporting Scalable Multi-Attribute Range Queries,” Proc. ACM SIGCOMM '04, pp.353-366, 2004.
[31] P.B. Godfrey and I. Stoica, “Heterogeneity and Load Balance in Distributed Hash Tables,” Proc. IEEE INFOCOM, 2005.
[32] M. Bienkowski, M. Korzeniowski, and F.M. Heide, “Dynamic Load Balancing in Distributed Hash Tables,” Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS), 2005.
[33] J. Byers, J. Considine, and M. Mitzenmacher, “Simple Load Balancing for Distributed Hash Tables,” Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS), 2003.
[34] I. Clarke, O. Sandberg, B. Wiley, and T.W. Hong, “Freenet: A Distributed Anonymous Information Storage and Retrieval System,” LNCS, vol. 2009, pp. 46-66, July 2001.
[35] F. Dabek, M.F. Kaashoek, D. Karger, R. Morris, and I. Stoica, “Wide-Area Cooperative Storage with CFS,” Proc. 18th ACM Symp. Operating Systems Principles (SOSP), 2001.
[36] M. Roussopoulos and M. Baker, “CUP: Controlled Update Propagation in Peer-to-Peer Networks,” Proc. USENIX Ann. Technical Conf., 2003.
[37] V. Ramasubramanian and E.G. Sirer, “Beehive: Exploiting Power Law Query Distributions for O(1) Lookup Performance in Peer to Peer Overlays,” Proc. First USENIX Symp. Networked Systems Design and Implementation (NSDI '04), pp. 331-342, 2004.
[38] L. Yin and G. Cao, “DUP: Dynamic-Tree Based Update Propagation in Peer-to-Peer Networks,” Proc. 21st Int'l Conf. Data Eng. (ICDE), 2005.
[39] W. Pugh, “Skip Lists: A Probabilistic Alternative to Balanced Trees,” Comm. ACM, vol. 32, no. 10, pp. 668-676, 1990.
[40] M. Abdallah and H.C. Le, “Scalable Range Query Processing for Large-Scale Distributed Database Applications,” Proc. Int'l Conf. Parallel and Distributed Computing Systems (PDCS), 2005.
[41] J.J. Jiang, F.L. Tang, F. Pan, and W.N. Wang, “Using Bidirectional Links to Improve Peer-to-Peer Lookup Performance,” J. Zhejiang Univ. SCIENCE A, vol. 7, no. 6, 2006.
[42] B. Chun, D. Culler, T. Roscoe, A. Bavier, L. Peterson, M. Wawrzoniak, and M. Bowman, “Planetlab: An Overlay Testbed for Broad-Coverage Services,” ACM SIGCOMM Computer Comm. Rev., vol. 33, no. 3, 2003.
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool