Limited reputation sharing in P2P systems
Authors:
Open Access
- 17 May 2004
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 91-101
Abstract
The increasing popularity of resource exchange through peer-to-peer networks has encouraged the development of ways to support more complex commercial transactions over these networks. Unfortunately, the prospect of higher volume and higher value transactions attracts agents seeking to exploit or weaken the network by propagating bad information and services. This paper presents advantages and disadvantages of resource selection techniques based on peer reputation. We evaluate the effect of limited reputation information sharing on the efficiency and load distribution of a peer-to-peer system. We show that limited reputation sharing can reduce the number of failed transactions by a factor of 20.Keywords
This publication has 12 references indexed in Scilit:
- Limited reputation sharing in P2P systems2004
- PPay2003
- Preserving peer replicas by rate-limited sampled voting2003
- A reputation system for peer-to-peer networks2003
- The Eigentrust algorithm for reputation management in P2P networks2003
- A reputation-based approach for choosing reliable resources in peer-to-peer networks2002
- The Dynamics of ReputationsSSRN Electronic Journal, 2002
- Choosing reputable servents in a P2P network2002
- Peer-to-peer data trading to preserve informationACM Transactions on Information Systems, 2002
- The Social Cost of Cheap PseudonymsJournal of Economics & Management Strategy, 2001