PathFinder: efficient lookups and efficient search in peer-to-peer networks

Authors:
Dirk Bradler;Lachezar Krumov;Max Mühlhäuser;Jussi Kangasharju
Affiliations:
TU Darmstadt, Germany;TU Darmstadt, Germany;TU Darmstadt, Germany;University of Helsinki, Finland
Venue:
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Year:
2011

Citing 4
Cited 0

Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Peer-to-Peer Systems and Applications (Lecture Notes in Computer Science)

Peer-to-Peer Systems and Applications (Lecture Notes in Computer Science)
Symphony: distributed hashing in a small world

USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications

Quantified Score

Hi-index	0.00

Visualization

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, Path-Finder, 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 millions of nodes.