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

DOI10.1007/978-3-540-89985-3_46MaRDI QIDQ3628418zbMATH OpenOpenAlexFDO

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

Publication date 20 May 2009

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89985-3_46

zbMATH Keywords

collaborationfree-riderincentivespeer-to-peer network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Counteracting free riding in Peer-to-Peer networks
• Free-riders impact on throughputs of peer-to-peer file-sharing systems
• Efficient search in P2P file sharing system
• scientific article; zbMATH DE number 5061965
• scientific article; zbMATH DE number 2080497

Cited in

(7)

• Free-riders impact on throughputs of peer-to-peer file-sharing systems
• An ``S-string scheme for business-oriented peer-to-peer networks
• Counteracting free riding in Peer-to-Peer networks
• Give-and-take based peer-to-peer content distribution networks
• Evaluation mechanism for preventing free-ider in super-node overlay
• Improve peer cooperation using social networks
• The incentive secure mechanism based on quality of service in P2P network

This page was built for publication: A New Algorithm for Combating Free-Riders in Structured P2P Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3628418)