Koorde: A simple degree-optimal distributed hash table
MF Kaashoek, DR Karger - Peer-to-Peer Systems II: Second International …, 2003 - Springer
Peer-to-Peer Systems II: Second International Workshop, IPTPS 2003, Berkeley …, 2003•Springer
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.
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.
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.
Springer