The Community for Technology Leaders
Green Image
Issue No. 04 - April (2010 vol. 21)
ISSN: 1045-9219
pp: 466-479
Anna Satsiou , Informatics and Telematics Institute, Thessaloniki and Department of Computer and Communication Engineering, Volos
Leandros Tassiulas , Department of Computer and Communication Engineering, Volos
In this paper, we study p2p systems, where peers have to share their available resources between their own and other peers' needs. One such example is a system of peers who use their capacity-limited access links both for their upstream and downstream connections. In the selfish approach, each peer would like to exploit the full capacity of his access link only for his downloads. However, if all peers acted selfishly, the system would collapse. In order to motivate peers to cooperate, we propose a distributed reputation-based system according to which peers earn reputation analogous to their contributions. In this way, each peer has to trade off the capacity he will dedicate for uploading in order to increase his reputation and therefore his revenue and the capacity he will dedicate for his downloads. All peers act rationally, trying to maximize their utility. Our proposed policies lead rational peers to cooperation while promoting fairness, as peers receive resources in proportion to their contributions. Our policies outperform existing work in this area in which the slowest link becomes the bottleneck of a heterogeneous system of different link capacity peers. On the contrary, no such bottleneck appears when our policies are used, improving the performance of the system. Finally, we apply our reputation-based approach in a BitTorrent-like file sharing system and we highlight the potential performance gains.
Cooperation enforcement, distributed resource allocation, P2P systems, reputation.

A. Satsiou and L. Tassiulas, "Reputation-Based Resource Allocation in P2P Systems of Rational Users," in IEEE Transactions on Parallel & Distributed Systems, vol. 21, no. , pp. 466-479, 2009.
89 ms
(Ver 3.3 (11022016))