Dynamic Load Sharing in Peer-to-Peer Systems: When Some Peers Are More Equal than Others

Authors:
Sabina Serbu;Silvia Bianchi;Peter Kropf;Pascal Felber
Affiliations:
University of Neuchâtel;University of Neuchâtel;University of Neuchâtel;University of Neuchâtel
Venue:
IEEE Internet Computing
Year:
2007

Citing 0
Cited 6

Managing collaborative feedback information for distributed retrieval

Proceedings of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval
Distribution fairness in Internet-scale networks

ACM Transactions on Internet Technology (TOIT)
Frequency-aware reconstruction of forwarding tables in name-based routing

Proceedings of the 5th International Conference on Future Internet Technologies
HyPeer: Structured overlay with flexible-choice routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
Collaborative ranking and profiling: exploiting the wisdom of crowds in tailored web search

DAIS'10 Proceedings of the 10th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
Self-stabilizing local k-placement of replicas with minimal variance

SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.