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/log log n) hops per lookup request with O(log n) neighbors per node.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bermond, J.-C., Fraigniaud, P.: Broadcasting and gossiping in de Bruijn networks. SIAM Journal on Computing 23(1), 212–225 (1994)
de Bruijn, N.: A combinatorial problem. In: Proc. Koninklijke Nederlandse Akademie van Wetenschappen, vol. 49, pp. 758–764 (1946)
Esfahanian, A., Hakimi, S.: Fault-tolerant routing in de bruijn communication networks. IEEE Trans. on Computers 34(9), 777–788 (1985)
Fraigniaud, P., Gauron, P.: The content-addressable network D2B. Tech. Rep. 1349, CNRS Universié de Paris Sud (January 2003)
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)
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)
Liben-Nowell, D., Balakrishnan, H., Karger, D.R.: Analysis of the evolution of peer-to-peer systems. In: Proc. PODC (August 2002)
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)
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)
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)
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)
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)
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)
Sivarajan, K., Ramaswami, R.: Multihop lightwave networks based on de bruijn graphs. In: INFOCOM 1992, pp. 1001–1011 (1992)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaashoek, M.F., Karger, D.R. (2003). Koorde: A Simple Degree-Optimal Distributed Hash Table. In: Kaashoek, M.F., Stoica, I. (eds) Peer-to-Peer Systems II. IPTPS 2003. Lecture Notes in Computer Science, vol 2735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45172-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-45172-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40724-9
Online ISBN: 978-3-540-45172-3
eBook Packages: Springer Book Archive