Download now Free registration required
In this paper, the authors 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. They call this the ''Load balancing problem'' of a P2P system. By providing an abstract formulation of the optimization problem, they contrast this problem with the network congestion control problem, both in terms of parallels and differences. They then proceed to study several versions and aspects of this problem: request allocation, neighbor selection, and server load minimization.
- Format: PDF
- Size: 623.32 KB