A dynamic game theory approach to solve the free riding problem in the peer‐to‐peer networks

A dynamic game theory approach to solve the free riding problem in the peer‐to‐peer networks

0.00 Avg rating0 Votes
Article ID: iaor2012555
Volume: 6
Issue: 1
Start Page Number: 43
End Page Number: 55
Publication Date: Feb 2012
Journal: Journal of Simulation
Authors: , , ,
Keywords: internet, behaviour, simulation: applications
Abstract:

The peer‐to‐peer (P2P) system has prevailed on the Internet. The old client‐server architecture is gradually becoming unable to satisfy users’ various requests and deal with the heavy loading of networks. Many applications adopt P2P architecture to provide more flexible and efficient service. However, P2P systems are not flawless. The anarchic property of P2P systems keeps participant behaviour uncontrolled. Thus, the behaviour of free riding occurs. This paper uses game theory to explore what results from free riding, designs a co‐opetition framework to solve the free riding problem, and also proposes a fairness index to monitor the efficiency of the whole system. Simulations are used to test co‐opetition under different environments.

Reviews

Required fields are marked *. Your email address will not be published.