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 millions of nodes. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Bradler, D., Krumov, L., Mühlhäuser, M., & Kangasharju, J. (2011). PathFinder: Efficient lookups and efficient search in peer-to-peer networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6522 LNCS, pp. 77–82). https://doi.org/10.1007/978-3-642-17679-1_7
Mendeley helps you to discover research relevant for your work.