A new algorithm for combating free-riders in structured P2P networks

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer-Verlag.

Cite

CITATION STYLE

APA

Raeesi N., M. R., Habibi, J., Raoufi, P., & Rostami, H. (2008). A new algorithm for combating free-riders in structured P2P networks. In Communications in Computer and Information Science (Vol. 6 CCIS, pp. 372–379). https://doi.org/10.1007/978-3-540-89985-3_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free