Abstract
Peer-to-Peer systems are designed to share resources of each computer for the common good of everyone in the system. As more and more p2p applications have been deployed, an important problem occurs that is the absence of incentive mechanism which encourages participants to contribute their resources to the system. To solve this problem, we present a novel mechanism of fair sharing, which intends to ensure that the resources amount consumed by one node is in proportion to that it contributes to the system. Moreover, this mechanism is able to defend itself against malicious attacks to some extent. Simulation results show that the commutation overhead of this mechanism is small in a very large scale.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proceedings of ACM SIGCOMM 2001, San Diego, California, USA (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location androuting for large-scale peer-to-peer systems. In: proceedings of the 18th IFIP/ACM International Conference on Distributed (2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A ScalableContent-Addressable Network. In: proceedings of ACM SIGCOMM 2001, San Diego, California, USA (2001)
Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing. Technical Report No. UCB/CSD-01-1141, University of California Berkeley (2001)
Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: proceedings of the eighteenth ACM symposium on Operating systems principles (2001)
Ripeanu, M.: Peer-to-peer Architecture Case Study: Gnutella. In: Proceedings of International Conference on P2P Computing (2001)
Kazaa, http://www.kazaa.com
Adar, E., Huberman, B.A.: Free Riding on Gnutella. First Monday, 5(10) (October 2000)
Foster, I., Tamnitchi, A.: On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)
Ngan, T.-W.J., Wallach, D.S., Druschel, P.: Enforcing Fair Sharing of Peer-to-Peer Resources. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Shneidman, J., Parkes, D.C.: Rationality and Self-Interest in Peer to Peer Networks. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)
Hardin, G.: The tragedy of the commons. Science 162, 1243–1248 (1968)
Sarou, S., Krishna, G.P., Gribble, S.D.: A measurement study of peer-to-peer files sharing systems. In: Proceedings of the SPIE Conference on Multimedia Computing and Networking, January 2002, pp. 156–170 (2002)
Feigenbaum, J., Shenker, S.: Distributed algorithmic mechanism design: recent results and future directions. In: Proceedings of the Dial-M 2002 (September 2002)
Fu, Y., Chase, J., Chun, B., Schwab, S., A.: SHARP: an architecture for secure resource peering. In: Proceedings of SOSP 2003 (October 2003)
Cox, L.P., Noble, B.D.: Samsara: honor among thieves in peer-to-peer storage. In: Proceedings of SOSP 2003 (October 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ma, Y., Wang, D. (2005). An Approach to Fair Resource Sharing in Peer-to-Peer Systems. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_73
Download citation
DOI: https://doi.org/10.1007/978-3-540-31957-3_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25338-9
Online ISBN: 978-3-540-31957-3
eBook Packages: Computer ScienceComputer Science (R0)