Advertisement

A Simple Fault Tolerant Distributed Hash Table

  • Moni Naor
  • Udi Wieder
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2735)

Abstract

We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is robust under random deletion of nodes. The second has parallel time of log n and message complexity of log2 n. It is robust under spam induced by a random subset of the nodes. We then show a construction which is fault tolerant against random deletions and has an optimal degree-dilation tradeoff. The construction has improved parameters when compared to other DHT’s. Its main merits are its simplicity, its flexibility and the fresh ideas introduced in its design. It is very easy to modify and to add more sophisticated protocols, such as dynamic caching and erasure correcting codes.

Keywords

Data Item Distribute Hash Table Message Complexity Faulty Node Geometric Random Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Byers, J.W., Luby, M., Mitzenmacher, M., Rege, A.: A digital fountain approach to reliable distribution of bulk data. In: SIGCOMM, pp. 56–67 (1998)Google Scholar
  2. 2.
    Fiat, A., Saia, J.: Censorship resistant peer-to-peer content addressable networks. In: Symposium on Discrete Algorithms, SODA (2002)Google Scholar
  3. 3.
    Karger, D.R., Lehman, E., Leighton, F.T., Panigrahy, R., Levine, M.S., Lewin, D.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In: ACM Symposium on Theory of Computing, May 1997, pp. 654–663 (May 1997)Google Scholar
  4. 4.
    Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: PODC (2002)Google Scholar
  5. 5.
    Naor, M., Wieder, U.: Novel architectures for p2p applications: the continuousdiscrete approach (2002), http://www.wisdom.weizmann.ac.il/~uwiede
  6. 6.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proc. ACM SIGCOMM, San Diego CA, August 2001, pp. 161–172 (2001)Google Scholar
  7. 7.
    Saia, J., Fiat, A., Gribble, S., Karlin, A.R., Saroiu, S.: Dynamically fault-tolerant content addressable networks. In: First International Workshop on Peer-to-Peer Systems, MIT Faculty Club, Cambridge, MA, USA (2002)Google Scholar
  8. 8.
    Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable Peer-To-Peer lookup service for internet applications. In: Proceedings of the 2001 ACM SIGCOMM Conference, pp. 149–160 (2001)Google Scholar
  9. 9.
    Weatherspoon, H., Kubiatowicz, J.D.: Erasure coding vs. replication: A quantitative comparison. In: First International Workshop on Peer-to-Peer Systems, MIT Faculty Club, Cambridge, MA, USA (2002)Google Scholar
  10. 10.
    Zhao, B.Y., Kubiatowicz, J.: 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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Moni Naor
    • 1
  • Udi Wieder
    • 1
  1. 1.The Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations