Counteracting free riding in Peer-to-Peer networks


Creative Commons License

Karakaya K. M., Körpeoǧlu I., Ulusoy Ö.

Computer Networks, vol.52, no.3, pp.675-694, 2008 (SCI-Expanded) identifier

  • Publication Type: Article / Article
  • Volume: 52 Issue: 3
  • Publication Date: 2008
  • Doi Number: 10.1016/j.comnet.2007.11.002
  • Journal Name: Computer Networks
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.675-694
  • Keywords: Distributed computing, Free riding, Gnutella, Peer-to-Peer networks, Performance evaluation
  • TED University Affiliated: Yes

Abstract

The existence of a high degree of free riding is a serious threat to Peer-to-Peer (P2P) networks. In this paper, we propose a distributed framework to reduce the adverse effects of free riding on P2P networks. Our solution primarily focuses on locating free riders and taking actions against them. We propose a framework in which each peer monitors its neighbors, decides if they are free riders, and takes appropriate actions. Unlike other proposals against free riding, our framework does not require any permanent identification of peers or security infrastructures for maintaining a global reputation system. Our simulation results show that the framework can reduce the effects of free riding and can therefore increase the performance of a P2P network. © 2007 Elsevier B.V. All rights reserved.