Abstract
Currently, peer-to-peer (P2P) networks suffer from users that do not contribute any kind of resources to the P2P community. Those users, which are called freeriders, benefit largely from contributions of other users but reduce the system performance for contributing users. This paper proposes an incentive scheme for P2P networks that motivates users to collaborate within the system. The solution that we propose has an impact on the topology formation of a P2P network. Using our market-managed topology formation algorithm (IUTopForm) for P2P networks, contributing users will be clustered within clubs that are different to clubs of freeriders. The differentiation is possible because of a reputation system, which considers users’ past contributions. The effect of this approach is that service requests of freeriders will take longer to be answered (if at all) than service requests of resource-contributing users. We illustrate this effect through measurements with our P2P network simulator. We also show that clubs are only interconnected if the difference in their reputation values is not large. The comparison with Bagla and Kapalia’s approach, which inspired our work, shows that the IUTopForm approach improves the overall utility of the system. The utility function and the topology formation algorithm are described in detail within this paper.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Eason, G., Noble, B., Sneddon, I.N.: On certain integrals of Lipschitz-Hankel type involving products of Bessel functions. Phil. Trans. Roy. Soc. London A247, 529–551 (1955)
Abdul-Rahman, A., Hailes, S.: Supporting Trust in Virtual Communities. In: IEEE Proceedings of theHawaii International Conference on System Sciences, Maui, Hawaii, January 4-7 (2000)
Aberer, K., Despotovic, Z.: Maximum Likelihood Estimation of Peers’ Performance in P2P Networks. EPFL - Swiss Federal Institute of Technology (2004)
Abrams, Z., McGrew, R., Plotkin, S.: Keeping Peers Honest in EigenTrust. Stanford University (2004)
Asvanund, A., Bagla, S., Kapadia, M., Krishnan, R., Smith, M., Telang, R.: Intelligent Club Management in Peer-to-Peer Networks. Carnegie Mellon, Heinz School of Public Policy and Management & Information Networking Institute (2003)
Bagla, S., Kapadia, M.H.: Peer-To-Peer Self-Organizing Communities. Carnegie Mellon University, Information Networking Institute (2003)
Brookshaw, L.: Java 2D Graph (1996) Retrieved on September 28, 2004, from http://www.sci.usq.edu.au/staff/leighb/graph/source/SpecialFunction.java
Cohen, B.: Incentives Build Robustness in Bittorrent. In: 1st Workshop on Economics of Peer-to-Peer Systems (June 2003)
Dutta, D., Goel, A., Govindan, R., Zhang, H.: The Design of A Distributed Rating Scheme for Peer-to-Peer Systems. University of Southern California / Stanford University (2003)
Feldman, M., Papadimitriou, C., Chuang, J., Stoica, I.: Free-Riding and Whitewashing in Peer-to-Peer Systems. In: ACM SIGCOMM 2004 Workshop on Practice and Theory of Incentives in Networked Systems (PINS) (August 2004)
Hee Lee, C., Hwang, J.: Agent-based Modeling for Differentiated Admission in P2P Systems Using Evolutionary Game Theory Focused on Ownership Reputation. Seoul National University / Syracuse University (2004)
Jennings, T.: Fido and FidoNet. Retrieved on August 19, 2004, from http://www.wps.com/FidoNet/
Kirk, P.: Gnutella 0.6 - Defining a Standard (2003) Retrieved on August 19, 2004, from http://rfc-gnutella.sourceforge.net/developer/index.html
Kung, H.T., Wu, C.: Differentiated Admission for Peer-to-Peer Systems: Incentivizing Peers to Contribute their Resources. Harvard University/ Academia Sinica (2003)
log4j project, Logging Services - log4j, Apache Software Foundation (2003) Retrieved on September 28, 2004, from http://logging.apache.org/log4j/docs/
McManus, S.: A short history of file sharing (2003) Retrieved on August 19, 2004, from http://www.sean.co.uk/a/musicjournalism/var/historyoffilesharing.shtm
Mello, J.: File Sharers Deserting Kazaa’s FastTrack Protocol (2004) Retrieved on August 18, 2004, from http://www.technewsworld.com/story/34305.html
RFC-Gnutella 0.6, “RFC-Gnutella 0.6,” Gnutella Developers Forum (2004) Retrieved on August 19, 2004, from http://rfc-gnutella.sourceforge.net/developer/testing/index.html
Ritter, J.: “Why Gnutella Can’t Scale,” No, Really... (2001) Retrieved on Aufust, 26, 2004, from http://www.darkridge.com/~jpr5/doc/gnutella.html
Rohrs.: Query Routing for the Gnutella Network (2001) Retrieved on August 26th, 2004, from http://rfc-gnutella.sourceforge.net/src/qrp.html
Tyan, H.: Design, Realization and Evaluation of a Component-Based Compositional Software Architecture for Network Simulation, Ohio State University (2002)
Usenet History, “Usenet Software: History and Sources,” interbulletin.com. Retrieved on August 19, 2004, from http://news.interbulletin.com/usenet_his.html
Walsh, K., Sirer, E.G.: Fighting Peer-to-Peer SPAM and Decoys with Object Reputation. In: Proceedings of the Third Workshop on the Economics of Peer-to-Peer Systems (p2pecon), Philadelphia, USA (2005)
Wikipedia, “Gnutella,” Wikipedia (2004) Retrieved on August 19, 2004, from http://en.wikipedia.org/wiki/Gnutella
Wikipedia, “Peer-to-peer,” Wikipedia (2004) Retrieved on August 18, 2004, from http://en.wikipedia.org/wiki/Peer-to-peer
Yang, M., Chen, H., Zhao, B.Y., Dai, Y., Zhang, Z.: Deployment of a Large-Scale Peer-to-Peer Social Network. In: WORLDS 2004 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Idris, T., Altmann, J. (2006). A Market-Managed Topology Formation Algorithm for Peer-to-Peer File Sharing Networks. In: Stiller, B., Reichl, P., Tuffin, B. (eds) Performability Has its Price. ICQT 2006. Lecture Notes in Computer Science, vol 4033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780502_7
Download citation
DOI: https://doi.org/10.1007/11780502_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35456-7
Online ISBN: 978-3-540-35457-4
eBook Packages: Computer ScienceComputer Science (R0)