Butterflies and peer-to-peer networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 310-322

  Datar, Mayur ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS;

CONTENT-ADDRESSABLE NETWORKS; DISTRIBUTED HASH TABLES; FAULT-TOLERANT; HYPERCUBE; PEER-TO-PEER SYSTEM; RANDOM FAULTS; RESOURCES BASED;

PEER TO PEER NETWORKS;

EID: 84938088835     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_30     Document Type: Conference Paper

References (13)

1. M. Datar. Butterflies and Peer-to-Peer Networks. Detailed version available at http://dbpubs.stanford.edu/pub/2002-33. 315, 319
2. 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. 310, 311, 312, 313, 316, 317, 320
3. 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. 312
4. Gnutella website. http://gnutella.wego.com/. 310
5. 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. 316
6. J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gum-madi, 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. 310
7. 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. 313, 314, 315
8. Napster website. http://www.napster.com/. 310
9. 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. 310, 311, 312, 318, 319
10. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proc. ofACM SIGCOMM 2001 Technical Conference, San Diego, CA, USA, August 2001. 310, 311, 312
11. S. Saroiu, P. Gummadi, and S. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. In Proc. ofMultimedia Computing and Networking, 2002. 310
12. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In Proc.ofACM SIGCOMM 2001 Technical Conference August 2001. 310, 311, 312, 314, 318, 319
13. E. Upfal. An 0(log N) deterministic packet-routing scheme. In Journal of ACM, Vol. 39, No. 1, Jan. 1992, pp 55-70. 313