Sciweavers

SIGECOM
2004
ACM

Robust incentive techniques for peer-to-peer networks

14 years 5 months ago
Robust incentive techniques for peer-to-peer networks
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, asymmetry 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 fully distributed and include: discriminating server selection, maxflowbased 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. Categories and Subject Descriptors C.2.4 [Computer-Communication Networks]: Distributed Systems; J.4 [Social And Behavioral Sciences]: Economics General Terms Design, Economics Keywords Incentives, peer-to-peer...
Michal Feldman, Kevin Lai, Ion Stoica, John Chuang
Added 30 Jun 2010
Updated 30 Jun 2010
Type Conference
Year 2004
Where SIGECOM
Authors Michal Feldman, Kevin Lai, Ion Stoica, John Chuang
Comments (0)