Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

IFIP International Conference on Network and Parallel Computing

NPC 2012: Network and Parallel Computing pp 77–84Cite as

  1. Home
  2. Network and Parallel Computing
  3. Conference paper
A Dynamic Popularity-Aware Load Balancing Algorithm for Structured P2P Systems

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

  • Narjes Soltani20,
  • Ehsan Mousavi Khaneghah20,
  • Mohsen Sharifi20 &
  • …
  • Seyedeh Leili Mirtaheri20 
  • Conference paper
  • 2323 Accesses

  • 5 Citations

Part of the Lecture Notes in Computer Science book series (LNTCS,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

Download conference paper PDF

References

  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. 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)

    CrossRef  Google Scholar 

  3. Ruhl, J.M.: Efficient algorithms for new computational models, USA, Techreport (2003)

    Google Scholar 

  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)

    CrossRef  Google Scholar 

  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)

    CrossRef  Google Scholar 

  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. 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 

Download references

Author information

Authors and Affiliations

  1. School of Computer Engineering, Iran University of Science and Technology, Tehran, Iran

    Narjes Soltani, Ehsan Mousavi Khaneghah, Mohsen Sharifi & Seyedeh Leili Mirtaheri

Authors
  1. Narjes Soltani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ehsan Mousavi Khaneghah
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohsen Sharifi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Seyedeh Leili Mirtaheri
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, SeoulTech, 172 Gongreung 2-dong, Nowon-gu, 139-743, Seoul, Korea

    James J. Park

  2. School of Information Technologies, The University of Sydney, Building J12, 2006, Sydney, NSW, Australia

    Albert Zomaya

  3. Division of Computer Engineering, Mokwon University, 88 Do-An-Buk-Ro, Seo-gu, 302-729, Daejeon, Korea

    Sang-Soo Yeo

  4. Department of Computer and Information Science and Engineering, University of Florida, CSE 301, 32611, Gainesville, FL, USA

    Sartaj Sahni

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Soltani, N., Khaneghah, E.M., Sharifi, M., Mirtaheri, S.L. (2012). A Dynamic Popularity-Aware Load Balancing Algorithm for Structured P2P Systems. In: Park, J.J., Zomaya, A., Yeo, SS., Sahni, S. (eds) Network and Parallel Computing. NPC 2012. Lecture Notes in Computer Science, vol 7513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35606-3_9

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-35606-3_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35605-6

  • Online ISBN: 978-3-642-35606-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature