An Efficient Load Balancing Algorithm for P2P Systems

Peer-to-Peer (P2P) networks are considered to be the most important development for content distribution and sharing infrastructures. The quality of services provided by the majority of the P2P systems is questioned. Load balancing among peers is critical and a key challenge. This paper proposes a load balancing algorithm based on stochastic analysis. It addresses the out-of-date problem as a result of node’s state changes during loads movement among nodes.

[1]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[2]  Yiming Hu,et al.  Efficient, proximity-aware load balancing for DHT-based P2P systems , 2005, IEEE Transactions on Parallel and Distributed Systems.

[3]  S.P. Dandamudi,et al.  A hierarchical load sharing policy for distributed systems , 1997, Proceedings Fifth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[4]  Edward D. Lazowska,et al.  A comparison of receiver-initiated and sender-initiated adaptive load sharing (extended abstract) , 1985, SIGMETRICS 1985.

[5]  Hisashi Kobayashi,et al.  Modeling and analysis , 1978 .

[6]  Thomas L. Casavant,et al.  A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems , 1988, IEEE Trans. Software Eng..

[7]  Jie Li,et al.  A Decomposition Algorithm for Optimal Static Load Balancing in Tree Hierarchy Network Configurations , 1994, IEEE Trans. Parallel Distributed Syst..

[8]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[9]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[10]  Richard M. Karp,et al.  Load Balancing in Structured P2P Systems , 2003, IPTPS.

[11]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[12]  Hisashi Kobayashi,et al.  System Modeling and Analysis: Foundations of System Performance Evaluation , 2008 .

[13]  Jeffrey Considine,et al.  Simple Load Balancing for Distributed Hash Tables , 2003, IPTPS.

[14]  S. Zhou,et al.  A Trace-Driven Simulation Study of Dynamic Load Balancing , 1987, IEEE Trans. Software Eng..

[15]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[16]  Edward D. Lazowska,et al.  Adaptive load sharing in homogeneous distributed systems , 1986, IEEE Transactions on Software Engineering.

[17]  Phillip Krueger,et al.  Adaptive Location Policies for Global Scheduling , 1994, IEEE Trans. Software Eng..

[18]  Srinivasan Seshan,et al.  Mercury: supporting scalable multi-attribute range queries , 2004, SIGCOMM '04.

[19]  Edward D. Lazowska,et al.  A Comparison of Receiver-Initiated and Sender-Initiated Adaptive Load Sharing , 1986, Perform. Evaluation.

[20]  Jingwen Wang,et al.  Utopia: A load sharing facility for large, heterogeneous distributed computer systems , 1993, Softw. Pract. Exp..

[21]  Brighten Godfrey,et al.  Heterogeneity and load balance in distributed hash tables , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[22]  Andrzej M. Goscinski,et al.  Distributed operating systems - the logical design , 1991 .

[23]  Richard M. Karp,et al.  Load balancing in dynamic structured P2P systems , 2004, IEEE INFOCOM 2004.

[24]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[25]  Mukesh Singhal,et al.  Load distributing for locally distributed systems , 1992, Computer.