Practical load balancing for content requests in peer-to-peer networks
Cached
Download Links
- [eecs.harvard.edu]
- [www.eecs.harvard.edu]
- [mosquitonet.stanford.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 14 - 0 self |
BibTeX
@MISC{Roussopoulos_practicalload,
author = {Mema Roussopoulos and Mary Baker},
title = {Practical load balancing for content requests in peer-to-peer networks},
year = {}
}
Years of Citing Articles
OpenURL
Abstract
This paper studies the problem of 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 which result in unutilized capacity. We propose a new decentralized algorithm, Max-Cap, based on the maximum inherent capacities of the replica nodes. We show that unlike previous algorithms, it is not tied to the timeliness or frequency of updates, and consequently requires significantly less update overhead. Yet, Max-Cap can handle the heterogeneity of a peer-to-peer environment without suffering from load oscillations.







