TU Darmstadt / ULB / TUbiblio

Self-Protection in P2P Networks : Choosing the Right Neighbourhood

Martinovic, Ivan ; Leng, Christof ; Zdarsky, Frank A. ; Mauthe, Andreas ; Steinmetz, Ralf ; Schmitt, Jens B. (2006)
Self-Protection in P2P Networks : Choosing the Right Neighbourhood.
first international workshop, IWSOS 2006, and Third International Workshop on New Trends in Network Architectures and Services, EuroNGI 2006. Passau, Germany (18.09.2006-20.09.2006)
Konferenzveröffentlichung, Bibliographie

Kurzbeschreibung (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.

Typ des Eintrags: Konferenzveröffentlichung
Erschienen: 2006
Autor(en): Martinovic, Ivan ; Leng, Christof ; Zdarsky, Frank A. ; Mauthe, Andreas ; Steinmetz, Ralf ; Schmitt, Jens B.
Art des Eintrags: Bibliographie
Titel: Self-Protection in P2P Networks : Choosing the Right Neighbourhood
Sprache: Englisch
Publikationsjahr: 2006
Ort: Berlin [u.a.]
Verlag: Springer
Buchtitel: Self-Organizing Systems : First International Workshop, IWSOS 2006 and Third International Workshop on New Trends in Network Architectures and Services, EuroNGI 2006, Passau, Germany, September 18-20, 2006, Proceedings
Reihe: Computer Communication Networks and Telecommunications
Band einer Reihe: 4124
Veranstaltungstitel: first international workshop, IWSOS 2006, and Third International Workshop on New Trends in Network Architectures and Services, EuroNGI 2006
Veranstaltungsort: Passau, Germany
Veranstaltungsdatum: 18.09.2006-20.09.2006
URL / URN: https://aproxy.ulb.tu-darmstadt.de:2060/10.1007/11822035_4
Zugehörige Links:
Kurzbeschreibung (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.

Fachbereich(e)/-gebiet(e): 18 Fachbereich Elektrotechnik und Informationstechnik
18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Datentechnik
18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Datentechnik > Multimedia Kommunikation
20 Fachbereich Informatik
20 Fachbereich Informatik > Datenbanken und Verteilte Systeme
Hinterlegungsdatum: 20 Nov 2008 08:28
Letzte Änderung: 31 Okt 2024 11:00
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen