TU Darmstadt / ULB / TUbiblio

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

Bradler, Dirk and Krumov, Lachezar and Kangasharju, Jussi and Mühlhäuser, Max
Aguilera, M. and Yu, H. and Vaidya, N. and Srinivasan, V. and Choudhury, R. (eds.) :

PathFinder: Efficient Lookups and Efficient Search in Peer-to-Peer Networks.
In: Distributed Computing and Networking: 12th International Conference, ICDCN 2011 , 6522
[Conference or Workshop Item] , (2011)

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 Erdo ̈s Renyi random graph. Consequently, all overlay operations such as key-value lookup, complex queries and main- tenance 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: Conference or Workshop Item
Erschienen: 2011
Editors: Aguilera, M. and Yu, H. and Vaidya, N. and Srinivasan, V. and Choudhury, R.
Creators: Bradler, Dirk and Krumov, Lachezar and Kangasharju, Jussi and Mühlhäuser, Max
Title: PathFinder: Efficient Lookups and Efficient Search in Peer-to-Peer Networks
Language: German
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 Erdo ̈s Renyi random graph. Consequently, all overlay operations such as key-value lookup, complex queries and main- tenance messages greatly benefit from the short average path length, the high number of alternative paths and the robustness of the underlying random graph topology.

Journal or Publication Title: Distributed Computing and Networking: 12th International Conference, ICDCN 2011
Volume: 6522
Uncontrolled Keywords: - SCS (Smart Civil Security);- P2P: QuaP2P (jointly with SCS);- SCS: ProTecT;Secure Services
Divisions: Department of Computer Science
Department of Computer Science > Telecooperation
LOEWE
LOEWE > LOEWE-Zentren
LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
Date Deposited: 31 Dec 2016 12:59
DOI: 10.1007
Identification Number: TUD-CS-2011-0008
Related URLs:
Export:

Optionen (nur für Redakteure)

View Item View Item