Self-protection in p2p networks: choosing the right neighbourhood

Authors:
Ivan Martinovic;Christof Leng;Frank A. Zdarsky;Andreas Mauthe;Ralf Steinmetz;Jens B. Schmitt
Affiliations:
Distributed Computer Systems Lab, University of Kaiserslautern, Germany;Databases & Distributed Systems, University of Technology Darmstadt, Germany;Distributed Computer Systems Lab, University of Kaiserslautern, Germany;Infolab 21, University of Lancaster, UK;Multimedia Communications Lab, University of Technology Darmstadt, Germany;Distributed Computer Systems Lab, University of Kaiserslautern, Germany
Venue:
IWSOS'06/EuroNGI'06 Proceedings of the First international conference, and Proceedings of the Third international conference on New Trends in Network Architectures and Services conference on Self-Organising Systems
Year:
2006

Citing 8
Cited 0

Managing trust in a peer-2-peer information system

Proceedings of the tenth international conference on Information and knowledge management
Performance analysis of the CONFIDANT protocol

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Self-Organized Public-Key Management for Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing
The Eigentrust algorithm for reputation management in P2P networks

WWW '03 Proceedings of the 12th international conference on World Wide Web
Managing and Sharing Servents' Reputations in P2P Systems

IEEE Transactions on Knowledge and Data Engineering
Pride: peer-to-peer reputation infrastructure for decentralized environments

Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Content availability, pollution and poisoning in file sharing peer-to-peer networks

Proceedings of the 6th ACM conference on Electronic commerce
Overcoming free-riding behavior in peer-to-peer systems

ACM SIGecom Exchanges

Quantified Score

Hi-index	0.00

Visualization

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.