TU Darmstadt / ULB / TUbiblio

PathFinder: Efficient Lookups and Efficient Search in Peer-to-Peer Networks

Bradler, Dirk and Krumov, Lachezar and Kangasharju, Jussi and Weihe, Karsten and Mühlhäuser, Max :
PathFinder: Efficient Lookups and Efficient Search in Peer-to-Peer Networks.

[Report] , (2010)

Abstract

Peer-to-Peer networks are divided into two main classes: unstructured and structured. Overlays from the first class are better suited for exhaustive search, whereas those from the second class offer very efficient key-value lookups. In this paper we present a novel overlay, PathFinder , which combines the advantages of both classes within one single overlay for the first time. Our evaluation shows that PathFinder is comparable or even better in terms of lookup and complex query performance than existing peer-to-peer overlays and scales to hundreds of millions of nodes. Peers in PathFinder are arranged as Erd¨os Renyi random graph. Consequently, all overlay operations such as key-value lookup, complex queries and maintenance messages greatly benefit from the short average path length, the high number of alternative paths and the robustness of the underlying random graph topology.

Item Type: Report
Erschienen: 2010
Creators: Bradler, Dirk and Krumov, Lachezar and Kangasharju, Jussi and Weihe, Karsten and Mühlhäuser, Max
Title: PathFinder: Efficient Lookups and Efficient Search in Peer-to-Peer Networks
Language: ["languages_typename_1" not defined]
Abstract:

Peer-to-Peer networks are divided into two main classes: unstructured and structured. Overlays from the first class are better suited for exhaustive search, whereas those from the second class offer very efficient key-value lookups. In this paper we present a novel overlay, PathFinder , which combines the advantages of both classes within one single overlay for the first time. Our evaluation shows that PathFinder is comparable or even better in terms of lookup and complex query performance than existing peer-to-peer overlays and scales to hundreds of millions of nodes. Peers in PathFinder are arranged as Erd¨os Renyi random graph. Consequently, all overlay operations such as key-value lookup, complex queries and maintenance messages greatly benefit from the short average path length, the high number of alternative paths and the robustness of the underlying random graph topology.

Uncontrolled Keywords: - SCS (Smart Civil Security);Secure Data
Divisions: Department of Computer Science
Department of Computer Science > Algorithmics
Department of Computer Science > Programming Methodology
Department of Computer Science > Telecooperation
Department of Computer Science > Ubiquitäre Peer-to-Peer Infrastrukturen
LOEWE
LOEWE > LOEWE-Zentren
LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
Event Location: Darmstadt, Germany
Date Deposited: 31 Dec 2016 12:59
Identification Number: TUD-CS-2010-1872
Related URLs:
Export:

Optionen (nur für Redakteure)

View Item View Item