Reputation in peer-to-peer networks

At the core of any peer-to-peer network is the primitive of routing, whereby peers assist each other by forwarding transit traffic. However, some nodes may adopt selfish behavior and drop transit traffic due to reasons such as competing commercial interest or conservation of bandwidth. Thus nodes must be able to detect misbehavior as well as use this information to avoid misbehaving nodes. We propose two reputation schemes to address this problem, focusing on the Chord routing protocol. In the first scheme, nodes submit keyspace ranges that they suspect to contain a misbehaving node, and all the ranges are intersected to narrow the keyspace. The second scheme introduces a new routing reputation metric that is allocated to each finger of chord nodes' routing table. This allows nodes to route to fingers with better reputation in order to have a greater chance of successful delivery. We also present simulation results to evaluate the performances of the two schemes.

[1]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[2]  Andrew Twigg,et al.  Trading in Trust, Tokens, and Stamps , 2003 .

[3]  Vana Kalogeraki,et al.  Finding good peers in peer-to-peer networks , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[4]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[5]  I. Foster,et al.  ‘To Share or not to Share’ An Analysis of Incentives to Contribute in Collaborative File Sharing Environments , 2003 .

[6]  Hector Garcia-Molina,et al.  Addressing the Non-Cooperation Problem in Competitive P2P Systems , 2003 .

[7]  Ion Stoica,et al.  Incentives for Cooperation in Peer-to-Peer Networks , 2003 .

[8]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[9]  Eytan Adar,et al.  Free Riding on Gnutella , 2000, First Monday.

[10]  Miguel Castro,et al.  Secure routing for structured peer-to-peer overlay networks , 2002, OSDI '02.

[11]  Bruce M. Maggs,et al.  Efficient content location using interest-based locality in peer-to-peer systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[12]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.