Skip to main content
SpringerLink
Log in

A New Algorithm for Combating Free-Riders in Structured P2P Networks

  • Conference paper
Advances in Computer Science and Engineering (CSICC 2008)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 6))

Included in the following conference series:

Abstract

The strength of a peer-to-peer (P2P) network depends on collaboration of participant nodes in file sharing. Free-riders are nodes that join the network and download files without sharing any files to be downloaded by others. In this paper, we introduce a novel algorithm to motivate nodes of structured P2P networks to share files and to limit downloads of free-riders. We measure effectiveness and efficiency of the algorithm using simulation and show that the algorithm significantly reduces percent of downloads of free-riders.

This research was in part supported by a grant from Iran Telecommunication Research Center.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gnutella website, http://www.gnutella.com

  2. Adar, E., Huberman, B.A.: Free riding on Gnutella, Technical Report. Xerox PARC 5(10), Augsut 10 (2000)

    Google Scholar 

  3. MyungJoo, H., Agha, G.: ARA: A Robust Audit to Prevent Free-Riding in P2P Networks. In: The Fifth IEEE International Conference on Peer-to-Peer Computing (P2P 2005), pp. 125–132 (2005)

    Google Scholar 

  4. eDonkey website, http://www.edonkey2000.com

  5. eMule website, http://www.emule-project.net

  6. Pruna website, http://www.pruna.com

  7. Lai, K., Feldman, M., Stoica, I., Chuang, J.: Incentives for Cooperation in Peer-to-Peer Networks. In: Proceedings of the Workshop on Economics of Peer-to-Peer Systems, Berkeley, California, USA, pp. 1–6 (June 2003)

    Google Scholar 

  8. Feldman, M., Chuang, J.: Overcoming Free-Riding Behavior in Peer-to-Peer Systems. ACM Sigecom Exchanges 5(4) (July 2005)

    Google Scholar 

  9. Feldman, M., Papadimitriou, C., Stoica, I., Chuang, J.: Free-Riding and Whitewashing in Peer-to-Peer Systems. In: Proc. SIGCOMM workshop on Practice and Theory of Incentives and Game Theory in Networked Systems, pp. 228–236 (2004)

    Google Scholar 

  10. Kamvar, D.S., Schlosser, T.M., Garcia-Molina, H.: Incentives for Combatting Freeriding on P2P Networks. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 1273–1279. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. PlanetSim website, http://www.planetsim.net

Download references

Author information

Authors and Affiliations

  1. Computer Engineering Department, Sharif University of Technology, Tehran, Iran

    Mohammad R. Raeesi N., Jafar Habibi, Pariya Raoufi & Habib Rostami

Authors
  1. Mohammad R. Raeesi N.
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jafar Habibi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pariya Raoufi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Habib Rostami
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IPM School of Computer Science, and Department of Computer Engineering, Sharif Unversity of Technology, Azadi Street, Tehran, Iran

    Hamid Sarbazi-Azad

  2. Department of Electrical and computer Engineering, UC Irvine, California, USA

    Behrooz Parhami

  3. Department of Computer Engineering, Sharif University of Technology,, Azadi Street, Tehran, Iran

    Seyed-Ghassem Miremadi

  4. Department of Computer Engineering, Sharif University of Technology, Azadi Street, Tehran, Iran

    Shaahin Hessabi

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Raeesi N., M.R., Habibi, J., Raoufi, P., Rostami, H. (2008). A New Algorithm for Combating Free-Riders in Structured P2P Networks. In: Sarbazi-Azad, H., Parhami, B., Miremadi, SG., Hessabi, S. (eds) Advances in Computer Science and Engineering. CSICC 2008. Communications in Computer and Information Science, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89985-3_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89985-3_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89984-6

  • Online ISBN: 978-3-540-89985-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation