Koorde: A Simple Degree-Optimal Distributed Hash Table

  • M. Frans Kaashoek
  • David R. Karger
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2735)

Abstract

Koorde is a new distributed hash table (DHT) based on Chord 15 and the de Bruijn graphs 2. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such as O(log n) hops per lookup request with only 2 neighbors per node (where n is the number of nodes in the DHT), and O(log n/loglogn) hops per lookup request with O(log n) neighbors per node.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bermond, J.-C., Fraigniaud, P.: Broadcasting and gossiping in de Bruijn networks. SIAM Journal on Computing 23(1), 212–225 (1994)CrossRefMathSciNetMATHGoogle Scholar
  2. 2.
    de Bruijn, N.: A combinatorial problem. In: Proc. Koninklijke Nederlandse Akademie van Wetenschappen, vol. 49, pp. 758–764 (1946)Google Scholar
  3. 3.
    Esfahanian, A., Hakimi, S.: Fault-tolerant routing in de bruijn communication networks. IEEE Trans. on Computers 34(9), 777–788 (1985)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Fraigniaud, P., Gauron, P.: The content-addressable network D2B. Tech. Rep. 1349, CNRS Universié de Paris Sud (January 2003)Google Scholar
  5. 5.
    Hildrum, K., Kubatowicz, J.D., Rao, S., Zhao, B.Y.: Distributed Object Location in a Dynamic Network. In: Proc. 14th ACM Symp. on Parallel Algorithms and Architectures (August 2002)Google Scholar
  6. 6.
    Karger, D., Lehman, E., Leighton, F., Levine, M., Lewin, D., Panigrahy, R.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In: Proc. 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, May 1997, pp. 654–663 (1997)Google Scholar
  7. 7.
    Liben-Nowell, D., Balakrishnan, H., Karger, D.R.: Analysis of the evolution of peer-to-peer systems. In: Proc. PODC (August 2002)Google Scholar
  8. 8.
    Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proceedings of Principles of Distributed Computing, PODC 2002 (July 2002)Google Scholar
  9. 9.
    Maymounkov, P., Mazieres, D.: Kademlia: A peer-to-peer information system based on the XOR metric. In: Proc. 1st International Workshop on Peer-to-Peer Systems (March 2002)Google Scholar
  10. 10.
    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
  11. 11.
    Rowstron, A., Druschel, P.: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  12. 12.
    Saia, J., Fiat, A., Gribble, S., Karlin, A., Saroiu, S.: Dynamically fault-tolerant content addressable networks. In: Proc. 1st International Workshop on Peer-to-Peer systems (March 2002)Google Scholar
  13. 13.
    Samatham, M., Pradham, D.: The de bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI. IEEE Trans. on Computers 38(4), 567–581 (1989)MATHCrossRefGoogle Scholar
  14. 14.
    Sivarajan, K., Ramaswami, R.: Multihop lightwave networks based on de bruijn graphs. In: INFOCOM 1992, pp. 1001–1011 (1992)Google Scholar
  15. 15.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proc. ACM SIGCOMM, San Diego (August 2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • M. Frans Kaashoek
    • 1
  • David R. Karger
    • 1
  1. 1.MIT Laboratory for Computer Science 

Personalised recommendations