Article ID Journal Published Year Pages File Type
453001 Computer Networks 2011 21 Pages PDF
Abstract

Intrinsically, P2P (Peer-to-Peer) networks are anonymous, dynamic and autonomous, which has the following implications: users can change their identities with near zero cost (cheap pseudonyms); most interactions should be one-time (that is, each peer has no idea about other peers’ behavior history, except their current behaviors); and all behaviors and actions are all endogenous, voluntarily chosen and determined by independent and rational peers. On the other hand, service differentiation based incentive mechanisms are proposed in P2P networks, which basically could be provided with two ways: punish defect behavior (punishment-based scheme), or reward cooperative behavior (reward-based scheme). Then the naturally resulted question is that: under the above P2P networking environment, how to effectively design service differentiation based resource-provision incentive mechanisms? Our contributions are threefold. First, we found that the traditional service differentiation based incentive schemes cannot successfully encourage peers to contribute resource to the whole system, irrespective of punishment-based and reward-based schemes. Then, if peers can voluntarily join the system, and small entry fee is set for participation, we obtained that the performance of punishment-based scheme (first providing high-level service plus punishment) is always better than that of reward-based scheme (first providing low-level service plus reward). Finally, unlike the existing result that was based on persistent users’ identities and truly repeated interactions, we illustrate that punisher’s average payoff in punishment-based scheme is almost same as the ideal but unfeasible case of reward-based scheme: rewarder could selectively reward other rewarders, and reward cost is zero.

Related Topics
Physical Sciences and Engineering Computer Science Computer Networks and Communications
Authors
, , , ,