A dynamic game theory approach to solve the free riding problem in the peer-to-peer networks
| Autor: | C.-W. Chena, Shi-Ming Huang, David C. Yen, Jing-Shiuan Hua |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Service (systems architecture)
021103 operations research Sequential game business.industry Computer science Distributed computing 0211 other engineering and technologies 02 engineering and technology Peer-to-peer computer.software_genre Free riding Modeling and Simulation 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing The Internet Discrete event simulation Architecture business computer Game theory Software |
| Zdroj: | Journal of Simulation. 6:43-55 |
| ISSN: | 1747-7786 1747-7778 |
| DOI: | 10.1057/jos.2011.11 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink