Self-protection in P2P Networks: Choosing the Right Neighbourhood

  • Ivan Martinovic
  • Christof Leng
  • Frank A. Zdarsky
  • Andreas Mauthe
  • Ralf Steinmetz
  • Jens B. Schmitt
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4124)

Abstract

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.

Keywords

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ivan Martinovic
    • 1
  • Christof Leng
    • 2
  • Frank A. Zdarsky
    • 1
  • Andreas Mauthe
    • 3
  • Ralf Steinmetz
    • 4
  • Jens B. Schmitt
    • 1
  1. 1.Distributed Computer Systems LabUniversity of KaiserslauternGermany
  2. 2.Databases & Distributed SystemsUniversity of Technology DarmstadtGermany
  3. 3.Infolab 21University of LancasterUK
  4. 4.Multimedia Communications LabUniversity of Technology DarmstadtGermany

Personalised recommendations