A simple fault tolerant distributed hash table

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

Volumn 2735, Issue , 2003, Pages 88-97

  Naor, Moni ^a   Wieder, Udi ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANCE;

DISTRIBUTED HASH TABLE; DISTRIBUTED HASH TABLES; DYNAMIC CACHING; ERASURE CORRECTING CODES; LOGARITHMIC DILATION; LOOKUP ALGORITHMS; MESSAGE COMPLEXITY; RANDOM SUBSETS;

PEER TO PEER NETWORKS;

EID: 34248566417     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45172-3_8     Document Type: Article

References (10)

1. J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege. A digital fountain approach to reliable distribution of bulk data. In SIGCOMM, pages 56-67, 1998.
2. A. Fiat and J. Saia. Censorship resistant peer-to-peer content addressable networks. In Symposium on Discrete Algorithms (SODA), 2002.
3. D. R. Karger, E. Lehman, F. T. Leighton, R. Panigrahy, M. S. Levine, and D. Lewin. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In ACM Symposium on Theory of Computing, pages 654-663, May 1997.
4. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In PODC, 2002.
5. ∼uwieder, 2002.
6. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proc ACM SIGCOMM, pages 161-172, San Diego CA, Augost 2001.
7. J. Saia, A. Fiat, S. Gribble, A. R. Karlin, and S. Saroiu. Dynamically fault-tolerant content addressable networks. In First International Workshop on Peer-to-Peer Systems, MIT Faculty Club, Cambridge, MA, USA, 2002.
8. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In Proceedings of the 2001 ACM SIGCOMM Conference, pages 149-160, 2001.
9. H. Weatherspoon and J. D. Kubiatowicz. Erasure coding vs. replication: A quantitative comparison. In First International Workshop on Peer-to-Peer Systems, MIT Faculty Club, Cambridge, MA, USA, 2002.
10. B.Y. Zhao and J. Kubiatowicz. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB CSD 01-1141, University of California at Berkeley, Computer Science Department, 2001.