A Structured Peer-to-Peer System with Integrated Index and Storage Load Balancing

  • Viet-Dung Le
  • Gilbert Babin
  • Peter Kropf
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3908)


Load balancing emerges as an important problem that affects the performance of structured peer-to-peer systems. This paper presents a peer-to-peer system relying on the partitionning of a de Bruijn graph. The proposed system integrates mechanisms that perform index and storage load balancing. Index load refers to the network traffic incurred by a peer in managing an object index, while storage load refers to the storage space and network traffic required to store objects. The proposed mechanisms allow to effectively distribute both index load and storage load according to the peers’ capacities.


Load Balance Distribute Hash Table Integrate Index Storage Load Load Balance Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bienkowski, M., Korzeniowski, M., auf der Heide, F.M.: Dynamic load balancing in distributed hash tables. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol. 3640, pp. 217–225. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    Byers, J., Considine, J., Mitzenmacher, M.: Simple load balancing for distributed hash table. In: IPTPS 2003 (February 2003)Google Scholar
  3. 3.
    Fraigniaud, P., Gauron, P.: Brief announcement: An overview of the content-addressable network d2b. In: ACM PODC 2003, July 2003, p. 151 (2003)Google Scholar
  4. 4.
    Kaashoek, M.F., Karger, D.R.: Koorde: A simple degree-optimal distributed hash table. In: IPTPS 2003 (February 2003)Google Scholar
  5. 5.
    Karger, D.R., Ruhl, M.: Simple efficient load balancing algorithms for peer-to-peer systems. In: ACM SPAA 2004, June 2004, pp. 36–43 (2004)Google Scholar
  6. 6.
    Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-theoretic analysis of structured peerto-peer systems: Routing distance and fault resilience. In: ACM SIGCOMM 2003 (August 2003)Google Scholar
  7. 7.
    Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: ACM PODC 2002, July 2002, pp. 183–192 (2002)Google Scholar
  8. 8.
    Manku, G.S.: Balanced binary trees for id management and load balance in distributed hash tables. In: ACM PODC 2004, July 2004, pp. 197–205 (2004)Google Scholar
  9. 9.
    Naor, M., Weider, U.: Novel architectures for p2p application: the continuous-discrete approach. In: ACM SPAA 2003 (June 2003)Google Scholar
  10. 10.
    Rao, A., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I.: Load balancing in structured p2p systems. In: IPTPS 2003 (February 2003)Google Scholar
  11. 11.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalabale contentaddressable network. In: ACM SIGCOMM 2001, August 2001, pp. 161–172 (2001)Google Scholar
  12. 12.
    Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  13. 13.
    Rowstron, A., Druschel, P.: Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. In: ACM SOSP 2001 (October 2001)Google Scholar
  14. 14.
    Stoica, I., Moris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM 2001, August 2001, pp. 149–160 (2001)Google Scholar
  15. 15.
    Wang, X., Zhang, Y., Li, X., Loguinov, D.: On zone-balancing of peer-to-peer networks: Analysis of random node join. In: ACM SIGMETRICS 2004 (June 2004)Google Scholar
  16. 16.
    Zhang, Z., Shi, S.-M., Zhu, J.: Self-balanced p2p expressways: When marxism meets confucian. Technical Report MSR-TR-2002-72, Microsoft Research (2002)Google Scholar
  17. 17.
    Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerance wide-area location and routing. Technical Report UCB/CSD-01-1141, University of California Berkeley (April 2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Viet-Dung Le
    • 1
  • Gilbert Babin
    • 2
  • Peter Kropf
    • 3
  1. 1.Department of Computer Science and Operations ResearchUniversity of MontrealMontréalCanada
  2. 2.Information Technologies, HEC MontréalMontréalCanada
  3. 3.Institute of Computer ScienceUniversity of NeuchâtelNeuchâtelSwitzerland

Personalised recommendations