A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Distributed Authentication for Peer-to-Peer Networks
SAINT-W '03 Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT'03 Workshops)
A Game Theoretic Framework for Incentives in P2P Systems
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
| Hi-index | 0.00 |
P2P systems have a very loose social structure and lack a central authority that enforces cooperative behavior. If peers choose not to contribute but to free ride, detecting and punishing misbehaviour is hard. Several solutions have been proposed that make anti-social behavior less profitable, all with different applications in mind. The two basic categories are payment schemes and reputation mechanisms.In this paper, we propose a new model for P2P systems and use it to analyse the effects of different reputation mechanisms on performance of the application. We identify basic classes of peers, reputation functions, resource distribution strategies, and adversary types, and present simultation results for a few systems composed of these building blocks. Finally, we expose an antagonism between the goal of establishing a distributed data structure with mostly noise-free reputation information and the goal of punishing free riders that all methods will have to face.