Free riding in peer-to-peer networks

Karakaya K. M., Korpeoglu I., Ulusoy Ö.

IEEE Internet Computing, vol.13, no.2, pp.92-98, 2009 (SCI-Expanded) identifier

  • Publication Type: Article / Article
  • Volume: 13 Issue: 2
  • Publication Date: 2009
  • Doi Number: 10.1109/mic.2009.33
  • Journal Name: IEEE Internet Computing
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.92-98
  • Keywords: Context, Data mining, Distributed computing, Free riding, Gain, Peer to peer computing, Peer-to-peer networks, Probability density function, Protocols, Security
  • TED University Affiliated: Yes

Abstract

Free riding in peer-to-peer (P2P) networks poses a serious threat to their proper operation. Here, the authors present a variety of approaches developed to overcome this problem. They introduce several unique aspects of P2P networks and discuss free riding's effects on P2P services. They categorize proposed solutions and describe each category's important features and implementation issues together with some sample solutions. They also discuss open issues, including common attacks and security considerations. © 2009 IEEE.