Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
The Power of Two Choices in Randomized Load Balancing
IEEE Transactions on Parallel and Distributed Systems
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Analysis of peer-to-peer file dissemination amongst users of different upload capacities
ACM SIGMETRICS Performance Evaluation Review
The Delicate Tradeoffs in BitTorrent-like File Sharing Protocol Design
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Performance bounds for peer-assisted live streaming
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Challenges, design and analysis of a large-scale p2p-vod system
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Gossiping With Multiple Messages
IEEE Transactions on Information Theory
Editorial: Editorial for special issue Internet-based Content Delivery
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In this paper, we consider a central problem in P2P content distribution: given a set of neighboring peers connected to each other to exchange content, how they can optimally negotiate the rate in helping each other so as to achieve maximum overall throughput and minimize the content server's load. We call this the ''load balancing problem'' of a P2P system. By providing an abstract formulation of the optimization problem, we contrast this problem with the network congestion control problem, both in terms of parallels and differences. We then proceed to study several versions and aspects of this problem: (a) request allocation, (b) neighbor selection, and (c) server load minimization. We have proposed and evaluated several practical algorithms that are discrete (window-based), distributed (without needing global information), and adaptive.