Robust incentive techniques for peer-to-peer networks

  • Authors:
  • Michal Feldman;Kevin Lai;Ion Stoica;John Chuang

  • Affiliations:
  • University of California - Berkeley, Berkeley, CA;Hewlett Packard Labs, Palo-Alto, CA;University of California - Berkeley, Berkeley, CA;University of California - Berkeley, Berkeley, CA

  • Venue:
  • EC '04 Proceedings of the 5th ACM conference on Electronic commerce
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Lack of cooperation (free riding) is one of the key problems that confronts today's P2P systems. What makes this problem particularly difficult is the unique set of challenges that P2P systems pose: large populations, high turnover, a symmetry of interest, collusion, zero-cost identities, and traitors. To tackle these challenges we model the P2P system using the Generalized Prisoner's Dilemma (GPD),and propose the Reciprocative decision function as the basis of a family of incentives techniques. These techniques are fullydistributed and include: discriminating server selection, maxflow-based subjective reputation, and adaptive stranger policies. Through simulation, we show that these techniques can drive a system of strategic users to nearly optimal levels of cooperation.