Article

Efficient lookup on unstructured topologies

Authors:

Ruggero Morselli,

Bobby Bhattacharjee,

Aravind Srinivasan,

Michael A. MarshAuthors Info & Claims

PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing

Pages 77 - 86

https://doi.org/10.1145/1073814.1073828

Published: 17 July 2005 Publication History

Abstract

We present LMS, a protocol for efficient lookup on unstructured networks. Our protocol uses a virtual namespace without imposing specific topologies. It is more efficient than existing lookup protocols for unstructured networks, and thus is an attractive alternative for applications in which the topology cannot be structured as a Distributed Hash Table (DHT).We present analytic bounds for the worst-case performance of our protocol. Through detailed simulations (with up to 100,000 nodes), we show that the actual performance on realistic topologies is significantly better. We also show in both simulations and a complete implementation (which includes over five hundred nodes) that our protocol is inherently robust against multiple node failures and can adapt its replication strategy to optimize searches according to a specific heuristic. Moreover, the simulation demonstrates the resilience of LMS to high node turnover rates, and that it can easily adapt to orders of magnitude changes in network size. The overhead incurred by LMS is small, and its performance approaches that of DHTs on networks of similar size.

References

[1]

I. Abraham and D. Malkhi. Probabilistic quorums for dynamic systems. In International Symposium on Distributed Computing (DISC), pages 60--74, 2003.

[2]

B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422--426, July 1970.

Digital Library

[3]

Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker. Making Gnutella-like P2P systems scalable. In Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pages 407--418. ACM Press, 2003.

Digital Library

[4]

J. Chu, K. Labonte, and B. N. Levine. Availability and locality measurements of peer-to-peer file systems. In Proc. ITCom: Scalability and Traffic Control in IP Networks II Conferences, volume 4868, July 2002.

[5]

I. Clarke, S. G. Miller, T. W. Hong, O. S. Sandberg, and B. Wiley. Protecting free expression online with Freenet. IEEE Internet Computing, 6(1), Jan./Feb. 2002.

Digital Library

[6]

P. Ganesan, Q. Sun, and H. Garcia-Molina. Yappers: A peer-to-peer lookup service over arbitrary topology. In 22nd Annual Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM), 2003.

[7]

C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In IEEE Infocom, 2004.

[8]

Gnutella http://www.gnutella.com.

[9]

S. Jiang, L. Guo, and X. Zhang. LightFlood: an efficient flooding scheme for file search in unstructured peer-to-peer systems. In International Conference on Parallel Processing, 2003.

[10]

Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks. In Proceedings of the 16th international conference on Supercomputing, pages 84--95. ACM Press, 2002.

Digital Library

[11]

D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: a scalable and dynamic emulation of the butterfly. In Proceedings of the twenty-first annual symposium on Principles of distributed computing, pages 183--192. ACM Press, 2002.

Digital Library

[12]

M. Mitzenmacher. Compressed Bloom filters. In 20th Annual ACM Symposium on Principles of Distributed Computing (PODC '01), pages 144--150, Newport, RI USA, August 26--29 2001. ACM Press.

Digital Library

[13]

A. Panconesi and A. Srinivasan. Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM J. Comput., 26(2):350--368, 1997.

Digital Library

[14]

V. Ramasubramanian and E. G. Sirer. Beehive: Exploiting power law query distributions for O(1) lookup performance in peer to peer overlays. In Proceedings of NSDI, 2004.

[15]

S. Ratnasamy, P. Francis, M. Handley, R. M. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM '01), pages 161--172, San Diego, CA USA, August 27--31 2001. ACM.

Digital Library

[16]

S. C. Rhea and J. Kubiatowicz. Probabilistic location and routing. In Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), Proceedings, volume 3, pages 1248--1257, New York, NY USA, June 23--27 2002. IEEE.

[17]

RipeanuGnutellaGraphs people.cs.uchicago.edu/~matei/GnutellaGraphs/

[18]

M. Ripeanu and I. T. Foster. Mapping the Gnutella network: Macroscopic properties of large-scale peer-to-peer systems. In P. Druschel, M. F. Kaashoek, and A. I. T. Rowstron, editors, Peer-to-Peer Systems, First International Workshop (IPTPS 2002), volume 2429 of Lecture Notes in Computer Science, pages 85--93, Cambridge, MA USA, March 7--8 2002. Springer.

Digital Library

[19]

A. I. Rowstron and P. Druschel. Pastry: Scalable, distributed object location, and routing for large-scale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), volume 2218 of Lecture Notes in Computer Science, pages 329--350, Heidelberg, Germany, 2001. Springer.

Digital Library

[20]

S. Saroiu, K. P. Gummadi, and S. D. Gribble. Measuring and analyzing the characteristics of Napster and Gnutella hosts. Multimedia Syst., 9(2):170--184, August 2003.

Digital Library

[21]

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM '01), pages 149--160, San Diego, CA USA, August 27--31 2001. ACM.

Digital Library

[22]

B. Zhao, K. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for fault-resilient wide-area location and routing. Technical Report UCB//CSD-01-1141, University of California at Berkeley Technical Report, 2001.

Digital Library

Cited By

Toce AMowshowitz AKawaguchi AStone PDantressangle PBent G(2017)An efficient hypercube labeling schema for dynamic Peer-to-Peer networksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2016.12.022102:C(186-198)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1016/j.jpdc.2016.12.022
Chuang Y(2016)Protecting against malicious and selective forwarding attacks for P2P search & retrieval systemPeer-to-Peer Networking and Applications10.1007/s12083-016-0500-110:4(1079-1100)Online publication date: 24-Aug-2016
https://doi.org/10.1007/s12083-016-0500-1
Chuang YMelliar-Smith PMoser LMichel Lombera I(2015)Maintaining censorship resistance in the iTrust network for publication, search and retrievalPeer-to-Peer Networking and Applications10.1007/s12083-015-0327-19:2(266-283)Online publication date: 12-Feb-2015
https://doi.org/10.1007/s12083-015-0327-1
Show More Cited By

Index Terms

Efficient lookup on unstructured topologies

Recommendations

Chord: a scalable peer-to-peer lookup protocol for internet applications

A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just ...
Re-Chord: A Self-stabilizing Chord Overlay Network

The Chord peer-to-peer system is considered, together with CAN, Tapestry and Pastry, as one of the pioneering works on peer-to-peer distributed hash tables (DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer systems ...
Efficient lookup on unstructured topologies

We present LMS, a protocol for efficient lookup on unstructured networks. Our protocol uses a virtual namespace without imposing specific topologies. It is more efficient than existing lookup protocols for unstructured networks, and thus is an ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing

July 2005

364 pages

ISBN:1581139942

DOI:10.1145/1073814

General Chair:
Marcos Aguilera
HP Labs
,
Program Chair:
James Aspnes
Yale University

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 July 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

PODC05

Sponsor:

PODC05: ACM Symposium on Principles of Distributed Computing

July 17 - 20, 2005

NV, Las Vegas, USA

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

35
Total Citations
View Citations
497
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)1

Reflects downloads up to 15 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Toce AMowshowitz AKawaguchi AStone PDantressangle PBent G(2017)An efficient hypercube labeling schema for dynamic Peer-to-Peer networksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2016.12.022102:C(186-198)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1016/j.jpdc.2016.12.022
Chuang Y(2016)Protecting against malicious and selective forwarding attacks for P2P search & retrieval systemPeer-to-Peer Networking and Applications10.1007/s12083-016-0500-110:4(1079-1100)Online publication date: 24-Aug-2016
https://doi.org/10.1007/s12083-016-0500-1
Chuang YMelliar-Smith PMoser LMichel Lombera I(2015)Maintaining censorship resistance in the iTrust network for publication, search and retrievalPeer-to-Peer Networking and Applications10.1007/s12083-015-0327-19:2(266-283)Online publication date: 12-Feb-2015
https://doi.org/10.1007/s12083-015-0327-1
Chuang Y(2015)An adaptable and scalable membership management for the iTrust information search and retrieval systemSecurity and Communication Networks10.1002/sec.12738:18(3492-3510)Online publication date: 1-Dec-2015
https://dl.acm.org/doi/10.1002/sec.1273
Ma WHu SDai QWang THuang Y(2014)Sybil-Resist: A New Protocol for Sybil Attack Defense in Social NetworkApplications and Techniques in Information Security10.1007/978-3-662-45670-5_21(219-230)Online publication date: 2014
https://doi.org/10.1007/978-3-662-45670-5_21
Sendín-Raña PGonzález-Castaño FGómez-Cuba FAsorey-Cacheda RPousada-Carballo J(2013)Improving Management Performance of P2PSIP for Mobile Sensing in Wireless OverlaysSensors10.3390/s13111536413:11(15364-15384)Online publication date: 8-Nov-2013
https://doi.org/10.3390/s131115364
Chuang YLombera IMelliar-Smith PMoser L(2012)Detecting and defending against malicious attacks in the iTrust information retrieval networkProceedings of the The International Conference on Information Network 201210.1109/ICOIN.2012.6164389(263-268)Online publication date: 1-Feb-2012
https://dl.acm.org/doi/10.1109/ICOIN.2012.6164389
Selvaraj CAnand S(2012)SurveyComputer Science Review10.1016/j.cosrev.2012.04.0016:4(145-160)Online publication date: 1-Jul-2012
https://dl.acm.org/doi/10.1016/j.cosrev.2012.04.001
Xu MZhou SGuan J(2012)Enhancing Routing Robustness of Unstructured Peer-to-Peer Networks Using Mobile AgentsJournal of Network and Systems Management10.1007/s10922-011-9203-320:3(309-352)Online publication date: 1-Sep-2012
https://dl.acm.org/doi/10.1007/s10922-011-9203-3
Gu TZhang DPung H(2011)An Ontology-Based P2P Network for Semantic SearchCloud, Grid and High Performance Computing10.4018/978-1-60960-603-9.ch019(299-312)Online publication date: 2011
https://doi.org/10.4018/978-1-60960-603-9.ch019
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents