This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dynamic Load Sharing in Peer-to-Peer Systems: When Some Peers Are More Equal than Others
July/August 2007 (vol. 11 no. 4)
pp. 53-61
Sabina Serbu, University of Neuchâtel
Silvia Bianchi, University of Neuchâtel
Peter Kropf, University of Neuchâtel
Pascal Felber, University of Neuchâtel
Object caching and replication are the primary mechanisms for addressing load balancing in peer-to-peer systems. In structured P2P networks, object popularity compounds the challenge as both the request and forwarding loads increase for the nodes responsible for high-demand objects. To balance loads across P2P networks, the authors propose a method for dynamically updating routing tables at peer nodes that redirects forwarding traffic to nodes in the same neighborhoods as those with popular objects.
Index Terms:
peer-to-peer, distributed hash tables, load balancing, resource allocation, P2P, DHT
Citation:
Sabina Serbu, Silvia Bianchi, Peter Kropf, Pascal Felber, "Dynamic Load Sharing in Peer-to-Peer Systems: When Some Peers Are More Equal than Others," IEEE Internet Computing, vol. 11, no. 4, pp. 53-61, July-Aug. 2007, doi:10.1109/MIC.2007.81
Usage of this product signifies your acceptance of the Terms of Use.