Computer Science – Networking and Internet Architecture
Scientific paper
2002-09-21
Computer Science
Networking and Internet Architecture
23 pages, 38 figures
Scientific paper
This paper studies the problem of load-balancing the demand for content in a peer-to-peer network across heterogeneous peer nodes that hold replicas of the content. Previous decentralized load balancing techniques in distributed systems base their decisions on periodic updates containing information about load or available capacity observed at the serving entities. We show that these techniques do not work well in the peer-to-peer context; either they do not address peer node heterogeneity, or they suffer from significant load oscillations. We propose a new decentralized algorithm, Max-Cap, based on the maximum inherent capacities of the replica nodes and show that unlike previous algorithms, it is not tied to the timeliness or frequency of updates. Yet, Max-Cap can handle the heterogeneity of a peer-to-peer environment without suffering from load oscillations.
Baker Mary
Roussopoulos Mema
No associations
LandOfFree
Practical Load Balancing for Content Requests in Peer-to-Peer Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Practical Load Balancing for Content Requests in Peer-to-Peer Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Practical Load Balancing for Content Requests in Peer-to-Peer Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-169278