Addressing the Out-of-date Problem for Efficient Load Balancing Algorithm in P2P Systems

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 215)


Load-balancing is of major significance for large-scale decentralized networks such as Peer-to-Peer (P2P networks in terms of enhanced scalability and performance. P2P networks are considered to be the most important development for content distribution and sharing infrastructures. Load balancing among peers in P2P networks is critical and a key challenge. This paper addresses the out-of-date problem as a result of node’s state changes during loads movement among nodes. Consequently, this work proposes a load balancing algorithm that is based on extensive stochastic analysis and virtual server concept in P2P System. Finally, this work is complemented with extensive simulations and experiments.


Out-of-date problem Peer-to-peer networks Virtual servers Load balancing 


  1. 1.
  2. 2.
    Saroiu S et al (2002) A measurement study of peer-to-peer sharing systems. In: Proceedings multimedia computing and networking conf (MMCN)Google Scholar
  3. 3.
    Sotica I et al (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM’01 pp 149–160Google Scholar
  4. 4.
    Rowstron A, Druschel P (2001) Pastry: Scalable distributed object location and routing for large-scale peer-to-peer systems. In Proceedings middlewareGoogle Scholar
  5. 5.
    Ratnasamy S et al (2001) A scalable content- addressable network. In Proceedings ACM SIGCOMM’01, CaliforniaGoogle Scholar
  6. 6.
    Derk I et al (1986) Adaptive load sharing in homogenous distributed systems. IEEE Trans on Soft Eng 12(5)Google Scholar
  7. 7.
    Bharambe AR et al (2004) Mercury: supporting scalable multi-attribute range queries. In Proceedings of the conference on applications, technologies, architectures, and protocols for computer communication. ACM, New YorkGoogle Scholar
  8. 8.
    Dabek F et al (2001) Wide-area cooperative storage with CFS. In:Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP’01), pp 2020-2215 Google Scholar
  9. 9.
    Godfrey et al (2004) Load balancing in dynamic structured P2P systems. In: Proceedings IEEE INFOCOMGoogle Scholar
  10. 10.
    Byers J (2003) Simple load balancing for distributed hash table. In: Proceedings of the second international workshop on peer-to-peer systems (IPTPS’03)Google Scholar
  11. 11.
    Rao A et al (2003) Load balancing in structured P2P systems. In Proceedings Of the second international . Workshop on peer-to-peer systems (IPTPS’03)Google Scholar
  12. 12.
    Godfrey PB, Stoica I (2005) Heterogeneity and load balance in distributed hash table. In: Proceedings IEEE INFOCOMGoogle Scholar
  13. 13.
    Li J, Kameda H (1994) A decomposition algorithm for optimal static load balancing in Tree hierarchy network configurations. IEEE Trans on parallel and distributed systems, 5(5)Google Scholar
  14. 14.
    Casavant TL, Kuhl JG ( 1988) A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Trans Softw Eng 14(2):141–154Google Scholar
  15. 15.
    Shivaratri NG et al (1992) Load distributing for locally distributed systems. Computer 25(12):33–44CrossRefGoogle Scholar
  16. 16.
    Goscinski A (1991) Distributed operating system: the logical design, Addison-WeslyGoogle Scholar
  17. 17.
    Zhou S (1988) A Trace-driven simulation study of dynamic load balancing. IEEE Trans Softw Eng 14(9):1327–1341Google Scholar
  18. 18.
    Eager DL et al (1985) A comparison of receiver-initiated and sender-initiated adaptive load sharing. SIGMETRICS Perform Eval Rev 13:2CrossRefGoogle Scholar
  19. 19.
    Kruger P, Shivaratri NG (1994) Adaptive location policies for global schedule. IEEE Soft Eng 20:432–443CrossRefGoogle Scholar
  20. 20.
    Zhou S et al (1993) Utopia: a load sharing facility for large, heterogeneous distributed computer systems. Softw Pract Experience 1305–1336Google Scholar
  21. 21.
    Dandamudi SP, Lo KC (1997) A hierarchical load sharing policy for distributed systems. In: Proceedings of the 5th International. Workshop on modeling, analysis, and simulation of computer and telecommunications systems, MASCOTS. IEEE CS, Washington, DCGoogle Scholar
  22. 22.
    Heyman DP (1982) Stochastic models in operation research, vol I. MxGraw-Hill Inc, New YorkGoogle Scholar
  23. 23.
    Kobayshi H (1978) Modeling and analysis: an introduction to system performance evaluation methodology. Addison-WesleyGoogle Scholar
  24. 24.
    Hisashi kobayshi et al (2009) System modeling and analysis: foundations of system performance evaluation. Prentice HallGoogle Scholar
  25. 25.
    Zhu Y Hu Y (2005) Efficient proximity-aware load balancing for DHT-based P2P systems. IEEE Trans On Parallel Distributed Syst, 16(4) 349–361Google Scholar
  26. 26.
    Andrzejak A, Graupner S, Kotov V, Trinks H (2007) Algorithms for self-organization and adaptive service placement in dynamic distributed systems. Internet systems and storage laboratoryGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.Computer Science Division, Mathematics DepartmentCollege of Science, Ain Shams UniversityCairoEgypt
  2. 2.Computer Science DepartmentCollege of Computer Science and Information TechnologyHofufSaudi Arabia

Personalised recommendations