Advertisement

A Dynamic Popularity-Aware Load Balancing Algorithm for Structured P2P Systems

  • Narjes Soltani
  • Ehsan Mousavi Khaneghah
  • Mohsen Sharifi
  • Seyedeh Leili Mirtaheri
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7513)

Abstract

Load balancing is one of the main challenges of structured P2P systems that use distributed hash tables (DHT) to map data items (objects) onto the nodes of the system. In a typical P2P system with N nodes, the use of random hash functions for distributing keys among peer nodes can lead to O(log N) imbalance. Most existing load balancing algorithms for structured P2Psystems are not proximity-aware, assume uniform distribution of objects in the system and often ignore node heterogeneity. In this paper we propose a load balancing algorithm that considers node heterogeneity, changes in object popularities, and link latencies between nodes. It also considers the load transfer time as an important factor in calculating the cost of load balancing. We present the algorithm using node movement and replication mechanisms. We also show via simulation how well the algorithm performs under different loads in a typical structured P2P system.

Keywords

Structured P2P Systems Load Balancing Node Movement Replication 

References

  1. 1.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols For Computer Communications, New York, NY, pp. 149–160 (2001)Google Scholar
  2. 2.
    Rao, A., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I.: Load Balancing in Structured P2P Systems. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 68–79. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  3. 3.
    Ruhl, J.M.: Efficient algorithms for new computational models, USA, Techreport (2003)Google Scholar
  4. 4.
    Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. SIGOPS Oper. Syst. Rev. 35(5), 202–215 (2001)CrossRefGoogle Scholar
  5. 5.
    Sharifi, M., Mirtaheri, S.L., Mousavi Khaneghah, E.: A Dynamic Framework for Inte-grated Management of All Types of Resources in P2P Systems. The Journal of Supercomputing 52(2), 149–170 (2010)CrossRefGoogle Scholar
  6. 6.
    Rieche, S., Petrak, L., Wehrle, K.: A thermal-dissipation-based approach for balancing data load in distributed hash tables. In: Proc. of 29th Annual IEEE Conference on Local Computer Networks (LCN), Germany, pp. 15–23 (2004)Google Scholar
  7. 7.
    Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.S.: Secure routing for structured peer-to-peer overlay networks. In: ACM SIGOPS Operating Systems Review, OSDI 2002: Proceedings of the 5th Symposium on Operating Systems Design and Implementation, New York, NY, USA, pp. 299–314 (2002)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2012

Authors and Affiliations

  • Narjes Soltani
    • 1
  • Ehsan Mousavi Khaneghah
    • 1
  • Mohsen Sharifi
    • 1
  • Seyedeh Leili Mirtaheri
    • 1
  1. 1.School of Computer EngineeringIran University of Science and TechnologyTehranIran

Personalised recommendations