Dynamically Fault-Tolerant Content Addressable Networks

  • Jared Saia
  • Amos Fiat
  • Steve Gribble
  • Anna R. Karlin
  • Stefan Saroiu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2429)

Abstract

We describe a content addressable network which is robust in the face of massive adversarial attacks and in a highly dynamic environment. Our network is robust in the sense that at any time, an arbitrarily large fraction of the peers can reach an arbitrarily large fraction of the data items. The network can be created and maintained in a completely distributed fashion.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Amos Fiat and Jared Saia. Censorship Resistant Peer-to-Peer Content Addressable Networks. In Symposium on Discrete Algorithms, 2002.Google Scholar
  2. [2]
    B.Y. Zhao, K.D. Kubiatowicz and A.D. 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, April 2001.Google Scholar
  3. [3]
    David Moore, Geoffrey Voelker and Stefan Savage. Inferring internet denial-ofservice activity. In Proceedings of the 2001 USENIX Security Symposium, 2001.Google Scholar
  4. [4]
    Ion Stoica, Robert Morris, David Karger, Frans Kaashoek and Hari Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In Proceedings of the ACM SIGCOMM 2001 Technical Conference, San Diego, CA, USA, August 2001.Google Scholar
  5. [5]
    Johan Hastad, Thomson Leighton and Mark Newman. Fast computation using faulty hypercubes. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989.Google Scholar
  6. [6]
    Mihir Bellare and Phillip Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In The First ACM Conference on Computer and Communications Security, pages 62–73, 1993.Google Scholar
  7. [7]
    Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi and Julien Stern. Scalable secure storage when half the system is faulty. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming, 2000.Google Scholar
  8. [8]
    Stefan Saroiu, P. Krishna Gummadi and Steven D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. In Proceedings of Multimedia Computing and Networking, 2002.Google Scholar
  9. [9]
    Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp and Scott Shenker. A Scalable Content-Addressable Network. In Proceedings of the ACM SIGCOMM 2001 Technical Conference, San Diego, CA, USA, August 2001.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Jared Saia
    • 1
  • Amos Fiat
    • 2
  • Steve Gribble
    • 1
  • Anna R. Karlin
    • 1
  • Stefan Saroiu
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of WashingtonSeattle
  2. 2.Department of Computer ScienceTel Aviv UniversityTel AvivIsrael

Personalised recommendations