Article

Free access

Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search

Authors:

Wesley W. Terpstra,

Jussi Kangasharju,

Alejandro P. BuchmannAuthors Info & Claims

SIGCOMM '07: Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications

Pages 49 - 60

https://doi.org/10.1145/1282380.1282387

Published: 27 August 2007 Publication History

Abstract

Peer-to-peer systems promise inexpensive scalability, adaptability, and robustness. Thus, they are an attractive platform for file sharing, distributed wikis, and search engines. These applications often store weakly structured data, requiring sophisticated search algorithms. To simplify the search problem, most scalable algorithms introduce structure to the network. However, churn or violent disruption may break this structure, compromising search guarantees.

This paper proposes a simple probabilistic search system, BubbleStorm, built on random multigraphs. Our primary contribution is a flexible and reliable strategy for performing exhaustive search. BubbleStorm also exploits the heterogeneous bandwidth of peers. However, we sacrifice some of this bandwidth for high parallelism and low latency. The provided search guarantees are tunable, with success probability adjustable well into the realm of reliable systems.

For validation, we simulate a network with one million low-end peers and show BubbleStorm handles up to 90% simultaneous peer departure and 50% simultaneous crash.

References

[1]

B. Bollobàs. Random Graphs. Cambridge University Press, 2nd edition, 2001.

[2]

V. Bourassa and F. B. Holt. SWAN: Small-world wide area networks. In SSGRR, 2003.

[3]

L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web Caching and Zipf-like Distributions: Evidence and Implications. In INFOCOM, pages 126--134, 1999.

[4]

Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker. Making gnutella-like P2P systems scalable. In SIGCOMM, pages 407--418, 2003.

Digital Library

[5]

C. Cooper, M. Dyer, and C. Greenhill. Sampling regular graphs and a peer-to-peer network. In SODA, pages 980--988, 2005.

Digital Library

[6]

P. T. Eugster, P. A. Felber, R. Guerraoui, and A. M. Kermarrec. The many faces of Publish/Subscribe. ACM Computing Surveys, 35(2):114--131, 2003.

Digital Library

[7]

R. A. Ferreira, M. K. Ramanathan, A. Awan, A. Grama, and S. Jagannathan. Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks. In P2P, pages 165--172, 2005.

Digital Library

[8]

C. Greenhill, F. B. Holt, and N. Wormald. Expansion properties of a random regular graph after random vertex deletions, 2007. European Journal of Combinatorics (to appear).

Digital Library

[9]

K. P. Gummadi, R. J. Dunn, S. Saroiu, S. D. Gribble, H. M. Levy, and J. Zahorjan. Measurement, Modeling and Analysis of a Peer-to-Peer File-Sharing Workload. In SOSP, pages 314--329, 2003.

Digital Library

[10]

D. Kempe, A. Dobra, and J. Gehrke. Gossip-Based Computation of Aggregate Information. In FOCS, pages 482--491, 2003.

Digital Library

[11]

J. Li, B. Loo, J. Hellerstein, F. Kaashoek, D. Karger, and R. Morris. On the feasibility of peer-to-peer web indexing and search. In IPTPS, 2003.

[12]

P. Maymounkov and D. Mazières. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In IPTPS, pages 53--65, 2002.

Digital Library

[13]

P. Reynolds and A. Vahdat. Efficient peer-to-peer keyword searching. In Middleware, pages 21--40, 2003.

Digital Library

[14]

K. Sankaralingam, S. Sethumadhavan, and J. C. Browne. Distributed Pagerank for P2P Systems. In HPDC, pages 58--68, 2003.

Digital Library

[15]

S. Saroiu, P. K. Gummadi, and S. D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. In MMCN, 2002.

[16]

N. Sarshar, P. O. Boykin, and V. P. Roychowdhury. Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable. In P2P, pages 2--9, 2004.

Digital Library

[17]

W. W. Terpstra, C. Leng, and A. P. Buchmann. Brief Announcement: Practical Summation via Gossip. In PODC, 2007.

Digital Library

[18]

W. W. Terpstra, C. Leng, and A. P. Buchmann. BubbleStorm: Analysis of Probabilistic Exhaustive Search in a Heterogeneous Peer-to-Peer System. Technical Report TUD-CS-2007-2, Technische Universität Darmstadt, Germany, 2007.

[19]

Wikimedia Foundation. What we need the money for. http://wikimediafoundation.org/w/index.php?title=What_we_need_the_money_for&oldid=18704

[20]

K.-H. Yang and J.-M. Ho. Proof: A DHT-based Peer-to-Peer Search Engine. In Conference on Web Intelligence, pages 702--708, 2006.

Digital Library

[21]

Y. Yang, R. Dunlap, M. Rexroad, and B. F. Cooper. Performance of Full Text Search in Structured and Unstructured Peer-to-Peer Systems. In INFOCOM, 2006.

Cited By

Chuang YLi F(2020)TCR: a trustworthy and churn-resilient academic distribution and retrieval system in P2P networksThe Journal of Supercomputing10.1007/s11227-020-03146-9Online publication date: 11-Jan-2020
https://doi.org/10.1007/s11227-020-03146-9
Chuang YYu CWu Q(2018)DSLMThe Journal of Supercomputing10.1007/s11227-017-2158-874:2(738-767)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1007/s11227-017-2158-8
Richerzhagen BRicherzhagen B(2018)State of the ArtMechanism Transitions in Publish/Subscribe Systems10.1007/978-3-319-92570-7_3(27-46)Online publication date: 28-Jul-2018
https://doi.org/10.1007/978-3-319-92570-7_3
Show More Cited By

Index Terms

Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search

Recommendations

Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search

Peer-to-peer systems promise inexpensive scalability, adaptability, and robustness. Thus, they are an attractive platform for file sharing, distributed wikis, and search engines. These applications often store weakly structured data, requiring ...
A resilient architecture for DHT-based distributed collaborative environments
SERENE '08: Proceedings of the 2008 RISE/EFTS Joint International Workshop on Software Engineering for Resilient Systems

Distributed Hash Tables (DHTs) provide a flexible and reliable infrastructure for data storage and retrieval in peer-to-peer communities. We propose to apply Kademlia DHT to organize data management and cooperation between users participating in ...
An OPNET simulation model for peer-to-peer networks

Peer-to-peer (P2P) traffic has increased rapidly over the past few years, with file sharing providing the main drive behind such traffic. Therefore, modeling P2P systems and studying their impact on the performance of the underlying network is a vital ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '07: Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications

August 2007

432 pages

ISBN:9781595937131

DOI:10.1145/1282380

General Chairs:
Jun Murai
Keio University, Japan
,
Kenjiro Cho
IIJ, Japan

ACM SIGCOMM Computer Communication Review Volume 37, Issue 4
October 2007
420 pages
ISSN:0146-4833
DOI:10.1145/1282427
Issue’s Table of Contents

Copyright © 2007 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: 27 August 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGCOMM07

Sponsor:

SIGCOMM07: ACM SIGCOMM 2007 Conference

August 27 - 31, 2007

Kyoto, Japan

Acceptance Rates

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

123
Total Citations
View Citations
967
Total Downloads

Downloads (Last 12 months)33
Downloads (Last 6 weeks)10

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chuang YLi F(2020)TCR: a trustworthy and churn-resilient academic distribution and retrieval system in P2P networksThe Journal of Supercomputing10.1007/s11227-020-03146-9Online publication date: 11-Jan-2020
https://doi.org/10.1007/s11227-020-03146-9
Chuang YYu CWu Q(2018)DSLMThe Journal of Supercomputing10.1007/s11227-017-2158-874:2(738-767)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1007/s11227-017-2158-8
Richerzhagen BRicherzhagen B(2018)State of the ArtMechanism Transitions in Publish/Subscribe Systems10.1007/978-3-319-92570-7_3(27-46)Online publication date: 28-Jul-2018
https://doi.org/10.1007/978-3-319-92570-7_3
Chuang YMelliar-Smith PMoser LLombera I(2016)Statistical Estimation and Dynamic Adaptation Algorithms for the iTrust Publication, Search and Retrieval SystemThe Computer Journal10.1093/comjnl/bxw03859:10(1492-1510)Online publication date: 15-Jul-2016
https://doi.org/10.1093/comjnl/bxw038
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
Frömmgen AHaas SStein MRehner RBuchmann AMühlhäuser MCrnkovic I(2015)Always the BestProceedings of the 2015 European Conference on Software Architecture Workshops10.1145/2797433.2797441(1-4)Online publication date: 7-Sep-2015
https://dl.acm.org/doi/10.1145/2797433.2797441
Chuang Y(2015)Trustworthy and Communal Social Classifieds Using HTTP and Wi-Fi2015 IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity)10.1109/SmartCity.2015.117(486-493)Online publication date: Dec-2015
https://doi.org/10.1109/SmartCity.2015.117
Zhang XJamin SYeung K(2015)Overlay Topology as Random-Walk Cache2015 IEEE 23rd International Conference on Network Protocols (ICNP)10.1109/ICNP.2015.38(366-375)Online publication date: Nov-2015
https://doi.org/10.1109/ICNP.2015.38
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
Barbian AMalenica DFiller TSchoettner M(2015)Omentum - A Peer-to-Peer Approach for Internet-Scale Virtual MicroscopyProceedings of the 8th International Conference on Internet and Distributed Computing Systems - Volume 925810.1007/978-3-319-23237-9_24(273-284)Online publication date: 2-Sep-2015
https://dl.acm.org/doi/10.1007/978-3-319-23237-9_24
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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

Media

Figures

Other

Tables

View Table of Contents