By Topic

Game Theory Analysis for Graded Punishment Mechanism Restraining Free-Riding in P2P Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wenjiao Li ; Henan Provincial Key Lab. on Inf. Networking, Zhengzhou Univ., Zhengzhou, China ; Jing Chen ; Bing Zhou

In recent years, various selfish behaviors of P2P network nodes have become increasingly severe, and the existence of free-riding, white-washing and the like deteriorates the performance of systems. This paper addresses the free-riding problem in P2P networks, and proposes a novel three-grade-punishment mechanism to restrain free-riding conducts in terms of game theory and reputation management to promote the mutual cooperation. The Nash Equilibrium is proved to be available for the rational nodes with this mechanism in a P2P system. The simulation results indicate that the proposed graded punishment mechanism is effective in restraining free-riding behaviors and improving cooperation between nodes.

Published in:

Computer Science and Society (ISCCS), 2011 International Symposium on

Date of Conference:

16-17 July 2011