A dynamic load balancing scheme with incentive mechanism in heterogeneous structured P2P networks

Dynamic load imbalance is a basic and inherent problem in structured P2P networks. Most existing research suffers from the problems of inefficiency in globally managing the nodes' load information and consumption of network bandwidth. This paper describes the mechanisms for collecting and globally managing the dynamic load of each node, and based on which to present a load balancing strategy which transfers the load from overloaded to under loaded nodes so as to improve load balancing efficiency. In order to encourage the rational and selfish nodes to actively participate in the load balancing process, we also propose an incentive mechanism in dynamic load balancing, by which the differentiated services could be provided for the nodes according to their load balancing abilities. The simulation results indicate that our approach could tackle the load imbalance problem in structured P2P networks effectively and efficiently in terms of the load distribution and the transferred load volume.

[1]  Jared Saia,et al.  Choosing a random peer , 2004, PODC '04.

[2]  Dongqing Xie,et al.  Self-Adaptive Load Balancing Method in Structured P2P Protocol: Self-Adaptive Load Balancing Method in Structured P2P Protocol , 2009 .

[3]  Yu Dan,et al.  An Improved P2P Model Based on Chord , 2005, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05).

[4]  Colin M. Ramsay,et al.  The Distribution of Sums of Certain I.I.D. Pareto Variates , 2006 .

[5]  Chyouhwa Chen,et al.  The Server Reassignment Problem for Load Balancing in Structured P2P Systems , 2008, IEEE Transactions on Parallel and Distributed Systems.

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

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

[8]  Edith Cohen,et al.  Replication strategies in unstructured peer-to-peer networks , 2002, SIGCOMM.

[9]  Gerhard Weikum,et al.  Near-optimal dynamic replication in unstructured peer-to-peer networks , 2008, PODS.

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

[11]  Karl Aberer,et al.  Query-load balancing in structured overlays , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[12]  Daoxu Chen,et al.  Replica Distribution for Search Size Minimization in Unstructured Overlay: Replica Distribution for Search Size Minimization in Unstructured Overlay , 2011 .

[13]  Yalin Ding,et al.  A dynamic load balancing strategy with the push and pull approaches in DHT networks , 2012, Comput. Electr. Eng..

[14]  David R. Karger,et al.  Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems , 2006, Theory of Computing Systems.

[15]  Haiying Shen,et al.  An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems , 2008, IEEE Transactions on Parallel and Distributed Systems.

[16]  Richard M. Karp,et al.  Load balancing in dynamic structured peer-to-peer systems , 2006, Perform. Evaluation.

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

[18]  Xie Dong.  Self-Adaptive Load Balancing Method in Structured P2P Protocol , 2009 .

[19]  Feng Guo.  Replica Distribution for Search Size Minimization in Unstructured Overlay , 2011 .