loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
24th IEEE International Conference on Distributed Computing Systems (ICDCS'04)
An Incentive Mechanism for P2P Networks
Hachioji, Tokyo, Japan
March 24-March 26
ISBN: 0-7695-2086-3
Richard T. B. Ma, Chinese University of Hong Kong
Sam C. M. Lee, Chinese University of Hong Kong
John C. S. Lui, Chinese University of Hong Kong
David K. Y. Yau, Purdue University
The current peer-to-peer (P2P) information sharing paradigm does not provide incentive and service differentiation for users. Since there is no motivation to share information or resources, this leads to the "free-riding" and the "tragedy of the commons" problems. In this paper, we address how one can incorporate incentive into the P2P information sharing paradigm so as to encourage users to share information and resources. Our mechanism (or protocol) provides service differentiation to users with different contribution values and connection types. The mechanism also has some desirable properties: (1) conservation of cumulative contribution and social utility in the P2P community, (2) maximization of social utility if all requesting clients have the same contribution value, and (3) incentive-based resource distribution. The resource distribution algorithm and the contribution update algorithm are computationally efficient and can be easily implemented. Experimental results illustrate the efficiency and fairness of our algorithms.
Citation:
Richard T. B. Ma, Sam C. M. Lee, John C. S. Lui, David K. Y. Yau, "An Incentive Mechanism for P2P Networks," icdcs, pp.516-523, 24th IEEE International Conference on Distributed Computing Systems (ICDCS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.