Neighbor selection for proportional fairness in P2P networks |
| |
| Affiliation: | 1. Georgia Regents University, Medical College of Georgia, Augusta, GA, USA;2. Wake Forest School of Medicine, Winston Salem, NC, USA;3. Case Western Reserve University, Cleveland, OH, USA;4. Temple University, Philadelphia, PA, USA;1. Department of Computer engineering, Pardis Branch, Islamic Azad University, Pardis, Iran;2. Computer Engineering and Information Technology Department, Amirkabir University of Technology, Tehran, Iran |
| |
| Abstract: | This paper analyzes reciprocation strategies in peer-to-peer networks from the point of view of the resulting resource allocation. Our stated aim is to achieve through decentralized interactions a weighted proportionally fair allocation. We analyze the desirable properties of such allocation, as well as an ideal proportional reciprocity algorithm to achieve it, using tools of convex optimization. We then seek suitable approximations to the ideal allocation which impose practical constraints on the problem: numbers of open connections per peer, with transport layer-induced bandwidth sharing, and the need of random exploration of the peer-to-peer swarm. Our solution in terms of a Gibbs sampler dynamics characterized by a suitable energy function is implemented in simulation, comparing favorably with a number of alternatives. |
| |
| Keywords: | Peer-to-peer networks Resource allocation Distributed algorithms Performance evaluation |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
