Koorde: A simple degree-optimal 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 98-107

  Kaashoek, M Frans ^a   Karger, David R ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANCE;

DE BRUIJN GRAPHS; DISTRIBUTED HASH TABLE; DISTRIBUTED HASH TABLES; LOOKUPS; LOWER BOUNDS;

PEER TO PEER NETWORKS;

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

References (15)

1. BERMOND, J.-C., AND FRAIGNIAUD, P. Broadcasting and gossiping in de Bruijn networks. SIAM Journal on Computing 23, 1 (1994), 212-225.
2. DE BRUIJN, N. A combinatorial problem. In Proc. Koninklijke Nederlandse Akademie van Wetenschappen (1946), vol. 49, pp. 758-764.
3. ESFAHANIAN, A., AND HAKIMI, S. Fault-tolerant routing in de bruijn communication networks. IEEE Trans. on Computers 34, 9 (1985), 777-788.
4. FRAIGNIAUD, P., AND GAURON, P. The content-addressable network D2B. Tech. Rep. 1349, CNRS Universié de Paris Sud, January 2003.
5. HILDRUM, K., KUBATOWICZ, J. D., RAO, S., AND ZHAO, B. Y. Distributed Object Location in a Dynamic Network. In Proc. 14th ACM Symp. on Parallel Algorithms and Architectures (Aug. 2002).
6. KARGER, D., LEHMAN, E., LEIGHTON, F., LEVINE, M., LEWIN, D., AND PANIGRAHY, R. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proc. 89th Annual ACM Symposium on Theory of Computing (El Paso, TX, May 1997), pp. 654-663.
7. LIBEN-NOWELL, D., BALAKRISHNAN, H., AND KARGER, D. R. Analysis of the evolution of peer-to-peer systems. In Proc. PODC 2002 (Aug. 2002).
8. MALKHI, D., NAOR, M., AND RATAJCZAK, D. Viceroy: A scalable and dynamic emulation of the butterfly. In Proceedings of Principles of Distributed Computing (PODC 2002) (July 2002).
9. MAYMOUNKOV, P., AND MAZIERES, D. Kademlia: A peer-to-peer information system based on the XOR metric. In Proc. 1st International Workshop on Peer-to-Peer Systems (Mar. 2002).
10. RATNASAMY, S., FRANCIS, P., HANDLEY, M., KARP, R., AND SHENKER, S. A scalable content-addressable network. In Proc. ACM SIGCOMM (San Diego, CA, August 2001), pp. 161-172.
11. ROWSTRON, A., AND DRUSCHEL, P. Pastry: Scalable, distributed object location and routing for large-s cale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middle-ware 2001) (Nov. 2001).
12. SAIA, J., FIAT, A., GRIBBLE, S., KARLIN, A., AND SAROIU, S. Dynamically fault-tolerant content addressable networks. In Proc. 1st International Workshop on Peer-to-Peer systems (Mar. 2002).
13. SAMATHAM, M., AND PRADHAM, D. The de bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI. IEEE Trans. on Computers 38, 4 (1989), 567-581.
14. SIVARAJAN, K., AND RAMASWAMI, R. Multihop lightwave networks based on de bruijn graphs. In INFOCOM'92, pp. 1001-1011.
15. STOICA, I., MORRIS, R., KARGER, D., KAASHOEK, M. F., AND BALAKRISHNAN, H. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proc. ACM SIGCOMM (San Diego, Aug. 2001).