TU Darmstadt / ULB / TUbiblio

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

Bradler, Dirk ; Krumov, Lachezar ; Kangasharju, Jussi ; Weihe, Karsten ; Mühlhäuser, Max (2010):
PathFinder: Efficient Lookups and Efficient Search in Peer-to-Peer Networks.
In: Lecture Notes in Computer Science, 6522, In: Distributed Computing and Networking, pp. 77-82,
Springer, 12th International Conference on Distributed Computing and Networking, Bangalore, India, 02.-05.01.2011, ISBN 978-3-642-17678-4,
DOI: 10.1007/978-3-642-17679-1_7,
[Conference or Workshop Item]

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: Conference or Workshop Item
Erschienen: 2010
Creators: Bradler, Dirk ; Krumov, Lachezar ; Kangasharju, Jussi ; Weihe, Karsten ; Mühlhäuser, Max
Title: PathFinder: Efficient Lookups and Efficient Search in Peer-to-Peer Networks
Language: English
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.

Title of Book: Distributed Computing and Networking
Series Name: Lecture Notes in Computer Science
Volume: 6522
Publisher: Springer
ISBN: 978-3-642-17678-4
Uncontrolled Keywords: - SCS (Smart Civil Security), Secure Data
Divisions: 20 Department of Computer Science
20 Department of Computer Science > Algorithmics
20 Department of Computer Science > Programming Methodology
20 Department of Computer Science > Telecooperation
20 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 Title: 12th International Conference on Distributed Computing and Networking
Event Location: Bangalore, India
Event Dates: 02.-05.01.2011
Date Deposited: 31 Dec 2016 12:59
DOI: 10.1007/978-3-642-17679-1_7
Identification Number: TUD-CS-2010-1872
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details