A game theoretic approach to provide incentive and service differentiation in P2P networks

Performance Evaluation Review

Volumn 32, Issue 1, 2004, Pages 189-198

  Ma, Richard T B ^a   Lee, Sam C M ^a   Lui, John C S ^a   Yau, David K Y ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b Purdue University   (United States)

Author keywords

Algorithm; Design; Economics

Indexed keywords

ALGORITHMS; DATA PROCESSING; DATA TRANSFER; GAME THEORY; INTERNET; MATHEMATICAL MODELS; RESOURCE ALLOCATION;

INTERNET TRAFFIC; NASH EQUILIBRIUM; NETWORK NODES; TRAFFIC MEASUREMENTS;

PACKET NETWORKS;

EID: 8344233542     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1012888.1005711     Document Type: Conference Paper

References (21)

1. The Gnutella Protocol Specification v0.4 1, document revision 1.2.
2. Limewire: a Gnutella client software.
3. E. Adar and B. Huberman. Free riding on Gnutella. FirstMonday, 2000.
4. D. Bertsekas and R. Gallager. Data Networks. Prentice-Hall, Englewood Cliffs, New Jersey, 1992.
5. J.-Y. Boudec. Rate adaptation, congestion control and fairness: A tutorial, http://icapeople.epfl.ch/leboudec.
6. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A distributed anonymous information storage and retrieval system. Lecture Notes in Computer Science, 2001.
7. A. C. Fuqua, T. Ngan, and D. S. Wallach. Economic behavior of peer-to-peer storage networks. Workshop on Economics of Peer-to-Peer Systems, June 2003.
8. P. Golle, K. Leyton-Brown, I. Mironov, and M. Lillibridge. Incentives for sharing in peer-to-peer networks. Proceedings of the ACM Conference on Electronic Commerce, 2001.
9. G. Hardin. The tragedy of the commons. Science, 162:1243-1248, 1968.
10. R. Ma, S. Lee, J. Lui, and D. Yau. Incentive P2P Networks: Theory and implementation. Technical report of Dept. of CSE, Chinese University of Hong Kong.
11. A. Mas-Colell, M. D. Whinston, and J. R. Green. Microeconomic theory. Oxford University Press, 1995.
12. N. Nisan and A. Ronen. Algorithmic mechanism design, 1999.
13. D. Parkes. Chapter 2, iterative combinatorial auctions: Achieving economic and computational efficiency ph.d. dissertation, univesity of Pennsylvania, May, 2001.
14. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proceedings of ACM SIGCOMM, 2001.
15. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science, 2218, 2001.
16. S. Shenker. Fundamental design issues for the future internet. IEEE Journal on Selected Areas in Communication, 13(7), September 1995.
17. J. Shneidman and D. Parkes. Rationality and self-interest in peer to peer networks. International Workshop on Peer-to-Peer Systems (IPTPS), 2003.
18. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM, 2001.
19. W. Wang and B. Li. To play or to control: a game-based control-theoretic approach to peer-to-peer incentive engineering. IWQoS, 2003.
20. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, Apr. 2001.
21. S. Zhong, Y. Yang, and J. Chen. Sprite: A simple, cheat-proof, credit-based system for mobile ad hoc networks, 2002.