Abstract
Research in Peer-to-peer systems has focussed on building efficient Content Addressable Networks (CANs), which are essentially distributed hash tables (DHT) that support location of resources based on unique keys. While most proposed schemes are robust to a large number of random faults, there are very few schemes that are robust to a large number of adversarial faults. In a recent paper ([2]) Fiat and Saia have proposed such a solution that is robust to adversarial faults.
We propose a new solution based on multi-butterflies that improves upon the previous solution by Fiat and Saia. Our new network, multihypercube, is a fault tolerant version of the hypercube, and may find applications to other problems as well. We also demonstrate how this network can be maintained dynamically. This addresses the first open problem in the paper ([2]) by Fiat and Saia.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Datar. Butterflies and Peer-to-Peer Networks. Detailed version available at http://dbpubs.stanford.edu/pub/2002-33.
A. Fiat, and J. Saia. Censorship Resistant Peer-to-Peer Content Addressable Network. In Proc. Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Jan. 2002.
J. Saia, A. Fiat, S. Gribble, A. Karlin, and S. Saroiu. Dynamically Fault-Tolerant Content Addressable Networks. In First International Workshop on Peer-to-Peer Systems, 2002.
Gnutella website. http://gnutella.wego.com/.
A. Goldberg, B. Maggs, and S. Plotkin. A parallel algorithm for reconfiguring a multi-butterfly network with faulty switches. In IEEE Transactions on Computers, 43(3), pp. 321–326, March 1994.
J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, and S. Rhea. OceanStore: An architecture for global-scale persistent storage. In Proc. of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems(ASPLOS 2000), Boston, MA, USA, November 2000.
T. Leighton, and B. Maggs. Expanders Might be Practical: Fast Algorithms for Routing Around Faults on Multibutterflies. In Proc. of 30th IEEE Symposium on Foundations of Computer Science, pp. 384–389, Los Alamitos, USA. 1989.
Napster website. http://www.napster.com/.
D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A Scalable and Dynamic Lookup Network. In Proc. of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), Monterey, CA, USA, July 2002.
S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proc. of ACM SIGCOMM 2001 Technical Conference, San Diego, CA, USA, August 2001.
S. Saroiu, P. Gummadi, and S. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. In Proc. of Multimedia Computing and Networking, 2002.
I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In Proc. of ACM SIGCOMM 2001 Technical Conference August 2001.
E. Upfal. An O(logN) deterministic packet-routing scheme. In Journal of ACM, Vol. 39, No. 1, Jan. 1992, pp 55–70.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Datar, M. (2002). Butterflies and Peer-to-Peer Networks. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_30
Download citation
DOI: https://doi.org/10.1007/3-540-45749-6_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44180-9
Online ISBN: 978-3-540-45749-7
eBook Packages: Springer Book Archive