Annales Des Télécommunications

, Volume 61, Issue 11–12, pp 1229–1281 | Cite as

BALLS: A structured peer-to-peer system with integrated load balancing

  • Viet Dung Le
  • Gilbert Babin
  • Peter Kropf
Article
Received:
Accepted:
  • 60 Downloads

Abstract

Load balancing is an important problem for structured peer-to-peer systems. We are particularly interested in the consumption of network bandwidth for routing traffic and in the usage of computer resources for object storage. In this paper, we investigate the possibility to simultaneously balance these two types of load. We present a structured peer-to-peer overlay that efficiently performs such simultaneous load balancing. The overlay is constructed by partitioning the nodes of a de Bruijn graph and by allocating the partitions to the peers. Peers balance network bandwidth consumption by repartitioning the nodes. Balancing of computer resources for storage is enabled by dissociating the actual storage location of an object from the location of its search key. The paper presents and analyzes the protocols required to maintain the overlay structure and perform load balancing. We demonstrate their efficiency by simulation. We also compare our proposed overlay network with other approaches.

Key words

Networking Peer to peer networking Balancing Network routing Distributed system Resource sharing 

BALLS : Un Système Pair-à-Pair Structuré Avec L’Équilibrage de Charge Intégré

Résumé

L’équilibrage de charge est un problème majeur des systèmes pair-à-pair structurés. Nous nous intéressons plus particulièrement à l’utilisation de la bande passante pour le routage de messages et à l’utilisation des ressources informatiques pour le stockage d’objets. Dans cet article, nous présentons un réseau pair-à-pair structuré permettant l’équilibrage efficace et simultané de ces deux types de charge. Le réseau est construit en partitionnant les nœuds d’un graphe de De Bruijn et en assignant les partitions aux pairs. Les pairs équilibrent l’utilisation de la bande passante en repartitionnant les nœuds. On équilibre l’utilisation des ressources informatiques pour le stockage en dissociant l’emplacement d’un objet de celui de sa clé de recherche. L’article présente et analyse les protocoles requis pour maintenir la structure de réseau et pour équilibrer la charge. Nous démontrons leur efficacité par simulation. Nous comparons également notre solution à d’autres approches.

Mots clés

Réseautique Communication pair à pair Équilibrage Routage réseau Système réparti Partage ressource 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    “The Gnutella web site, www.gnutella.com”, 2006.Google Scholar
  2. [2]
    “The KaZaA web site, www.kazaa.com”, 2006.Google Scholar
  3. [3]
    Stoica (I.),Moris (R.),Karger (D.),Kaashoek (M. F.),Balakrishnan (H.), “Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications”, inACM SIGCOMM’01, Aug. 2001, pp. 149–160.Google Scholar
  4. [4]
    Ratnasamy (S.),Francis (P.),Handley (M.),Karp (R.),Shenker (S.), “A Scalable Content-Addressable Network”, inACM SIGCOMM’01, Aug. 2001, pp. 161–172.Google Scholar
  5. [5]
    Rowstron (A.),Druschel (P.), “Pastry: Scalable, Decentralized Object Location and Routing for Large-scale Peer-to-peer Systems”, inIFIP/ACM Middleware’01, Nov. 2001, pp. 329–350.Google Scholar
  6. [6]
    Aberer (K.), Cudré-Mauroux (P.), Datta (A.), Despotovic (Z.), Hauswirth (M.), Punceva (M.), Schmidt (R.), “P-Grid: A Selforganizing Structured P2P System”,S1GMOD Record, vol. 32, no 3, pp. 29–33, 2003.CrossRefGoogle Scholar
  7. [7]
    Fraigniaud (P.),Gauron (P.), “Brief Announcement: An Overview of the Content-Addressable Network D2B”, inACM PODC’03, July 2003, p. 151.Google Scholar
  8. [8]
    Kaashoek (M. F.),Karger (D. R.), “Koorde: A Simple Degree-Optimal Distributed Hash Table”, inIPTPS’03, LNCS 2735, Springer Berlin/Heidelberg, Feb. 2003, pp. 98–107.Google Scholar
  9. [9]
    Malkhi (D.),Naor (M.),Ratajczak (D.), “Viceroy: A Scalable and Dynamic Emulation of the Butterfly”, inACM PODC’02, July 2002, pp. 183–192.Google Scholar
  10. [10]
    Naor (M),Weider (U.), “Novel Architectures for P2P Application: the Continuous-Discrete Approach”, inACM SPAA’03, June 2003, pp. 50–59.Google Scholar
  11. [11]
    Zhao (BY.), Huang (L.), Stribling (J.), Rhea (S.C.), Joseph (A.D.), Kubiatowicz (J.D.), “Tapestry: A Resilient Global-Scale Overlay for Service Deployment”,IEEE Journal on Selected Areas in Communications, vol. 22, no 1, pp. 41–53, Jan. 2004.CrossRefGoogle Scholar
  12. [12]
    Le (V. D.),Babin (G.),Kropf (P.), “A Structured Peer-to-peer System with Integrated Index and Storage Load Balancing”, inInnovative Internet Community Systems (I2CS’05), LNCS 3908, Springer Berlin/Heidelberg, T. Boehme, H. Unger, A. Bui, and M. Bui, Eds., Paris, France, June 2005, pp. 41–52.Google Scholar
  13. [13]
    Bienkowski (M),Korzeniowski (M.),Auf der Heide (F. M.), “Dynamic Load Balancing in Distributed Hash Tables”, inIPTPS’05, LNCS 3640, Springer Berlin/Heidelberg, Feb. 2005, pp. 217–225.Google Scholar
  14. [14]
    Manku (G. S.), “Balanced Binary Trees for ID Management and Load Balance in Distributed Hash Tables”, inACM PODC’04, July 2004, pp. 197–205.Google Scholar
  15. [15]
    Loguinov (D.),Kumar (A.),Rai (V.),Ganesh (S.), “Graph-Theoretic Analysis of Structured Peer-to-peer Systems: Routing Distance and Fault Resilience”, inACM SIGCOMM’03, Aug. 2003, pp. 395–406.Google Scholar
  16. [16]
    Wang (X.),Zhang (Y.),Li (X.),Loguinov (D.), “On ZoneBalancing of Peer-to-Peer Networks: Analysis of Random Node Join”, inACM SIGMETRICS’04, June 2004, pp. 211–222.Google Scholar
  17. [17]
    Karger (DR.),Ruhl (M.), “Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems”, inIPTPS’04, Feb. 2004, pp. 131–140.Google Scholar
  18. [18]
    ---, “Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems”, inACM SPAA’04, June 2004, pp. 36–43.Google Scholar
  19. [19]
    Rao (A.),Lakshminarayanan (K.),Surana (S.),Karp (R.),Stoica (I.), “Load Balancing in Structured P2P Systems”, inIPTPS’03, LNCS 2735, Springer Berlin/Heidelberg, Feb. 2003, pp. 68–79.Google Scholar
  20. [20]
    Rowstron (A.),Druschel (P.), “Storage Management and Caching in PAST, a Large-scale, Persistent Peer-to-peer Storage Utility”, inACM SOSP’01, Oct. 2001, pp. 188–201.Google Scholar
  21. [21]
    Byers (J.),Considine (J.),Mitzenmacher (M.), “Simple Load Balancing for Distributed Hash Table”, inIPTPS’03, LNCS 2735, Springer Berlin/Heidelberg, Feb. 2003, pp. 80–87.Google Scholar
  22. [22]
    Zhang (Z.),Shi (S.-M.),Zhu (J.), “Self-balanced P2P Expressways: When Marxism Meets Confucian”, Microsoft Research, Tech. Rep. MSR-TR-2002-72, 2002.Google Scholar
  23. [23]
    Naor (M.),Wieder (U.), “A Simple Fault Tolerant Distributed Hash Tables”, inIPTPS’03, LNCS 2735, Springer Berlin / Heidelberg, Feb. 2003, pp. 88–97.Google Scholar
  24. [24]
    Le (V.D.),Babin (G.),Kropf (P.), “BALLS Simulator: Evaluator of a Structured Peer-to-peer System with Integrated Load Balancing”, inResearch, Innovation and Vision for the Future (RIVF’06), Addendum contributions, Ho Chi Minh City, Vietnam, Feb. 2006, pp. 59–64.Google Scholar
  25. [25]
    Ge (Z.),Figueiredo (D.),Jaiswal (S.),Kurose (J.),Towsley (D.), “Modeling Peer-Peer File Sharing Systems”, inIEEE INFOCOM’03, 2003.Google Scholar
  26. [26]
    Lv (Q.),Ratnasamy (S.),Shenker (S.), “Can Heterogeneity Make Gnutella Scalable?”, inIPTPS’02, LNCS 2429, Springer Berlin/Heidelberg, Mar. 2002, pp. 94–103.Google Scholar
  27. [27]
    Saroiu (S.),Gummadi (K.),Dunn (R.),Gribble (S.),Levy (H.), “An Analysis of Internet Content Delivery Systems”, in0SDI’02, Dec. 2002, pp. 315–327.Google Scholar
  28. [28]
    Zhang (Z.),Shi (S.-M.),Zhu (J.), “SOMO: Self-organized Metadata Overlay for Resource Management in P2P DHT”, inIPTPS’03, LNCS 2735, Springer Berlin/Heidelberg, Feb. 2003, pp. 170–182.Google Scholar
  29. [29]
    Bhagwan (R.),Savage (S.),Voelker (G.), “Understanding Availability”, inIPTPS’03, LNCS 2735, Springer Berlin/Heidelberg, Feb. 2003, pp. 256–267.Google Scholar
  30. [30]
    Downey (A.B.), ’The Structural Cause of File Size Distributions”, in 9th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS’01), 2001, p. 361.Google Scholar
  31. [31]
    Douceur (J. R.),Bolosky (W.J.), “A Large-scale Study of File-system Contents”, inACM SIGMETRICS’99, Atlanta, GA, May 1999, pp. 59–70.Google Scholar

Copyright information

© Springer-Verlag France 2006

Authors and Affiliations

  • Viet Dung Le
    • 1
  • Gilbert Babin
    • 2
  • Peter Kropf
    • 3
  1. 1.Département d’informatique et de recherche opérationnelleUniversité de MontréalMontréalCanada
  2. 2.Technologies de l’informationHEC MontréalMontréalCanada
  3. 3.Institut d’informatiqueUniversité de NeuchâtelNeuchâtelSwitzerland

Personalised recommendations