Self-Organizing Systems

Volume 4124 of the series Lecture Notes in Computer Science pp 23-33

Self-protection in P2P Networks: Choosing the Right Neighbourhood

  • Ivan MartinovicAffiliated withDistributed Computer Systems Lab, University of Kaiserslautern
  • , Christof LengAffiliated withDatabases & Distributed Systems, University of Technology Darmstadt
  • , Frank A. ZdarskyAffiliated withDistributed Computer Systems Lab, University of Kaiserslautern
  • , Andreas MautheAffiliated withInfolab 21, University of Lancaster
  • , Ralf SteinmetzAffiliated withMultimedia Communications Lab, University of Technology Darmstadt
  • , Jens B. SchmittAffiliated withDistributed Computer Systems Lab, University of Kaiserslautern

* Final gross prices may vary according to local VAT.

Get Access


In unstructured peer-to-peer networks, as in real life, a good neighbourhood is not only crucial for a peaceful sleep, but also for an exchange of important gossips and for finding good service.

This work investigates self-protection mechanisms based on reputation in unstructured peer-to-peer networks. We use a simple approach where each peer rates the service provided by others and exchanges the collected knowledge with its direct neighbours. Based on reputation values peers manage their connections to direct neighbours and make service provisioning decisions.

To quantify the impact of our proposed scheme, we implement a simple protocol in a fully unstructured peer-to-peer network. We show that free riding and the impact of malicious peers trying to poison the network with bad files is minimised. Furthermore, we show that a good neighbourhood protects peers from selecting bad files, while free riders suffer in a bad neighbourhood of malicious peers.


Self-protection Peer-to-Peer Trustworthiness Reputation Free- Riding Network Poisoning