Koorde: A Simple Degree-Optimal Distributed Hash Table
By M. Frans Kaashoek, David R Karger. International Workshop on Peer-to-Peer Systems, 2003
669 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/e1561969e537194911b929410804a40614bf300a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Jennifer Rexford
- N. Feamster
- Prateek Mittal
- Henry C. M. Leung
- Nikita Borisov
- Francis Y. L. Chin
- Shishir Nagaraja
- Siu Ming Yiu
Citations in the corpus
- OverSim: A Flexible Overlay Network Simulation Framework (2007, methodology): “Most of them are structured peer-to-peer protocols like Chord [9], Kademlia [5], Koorde [ 4 ], and Broose [12], but unstructured peer-to-peer protocols like GIA [13] are available as well.”
- IDBA - A Practical Iterative de Bruijn Graph De Novo Assembler (2010, methodology): “I The DHT protocol Koorde uses a De Bruijn graph ([3]).”
- The design and implementation of a next generation name service for the internet (2004, methodology): “A few DHTs use De Bruijn graphs [22, 40] to achieve O( log N log log N ) lookup performance.”
- BotGrep: Finding P2P Bots with Structured Graph Analysis (2010, methodology): “In particular, we observed several key results: Effect of botnet topology: To study applicability of our approach to different botnet topologies, we consider Kademlia [50], Chord [70], and de Bruijn graphs.”
- In VINI veritas: realistic and controlled network experimentation (2006, methodology): “Tracing at such scale, however, presents new methodological challenges, such as globally synchronizing events in time across subsets of monitors as well as across channels; previous efforts either focus on separate channels [13], do not merge traces among monitors [21], or merge only a small number ”
- The rainbow skip graph: a fault-tolerant constant-degree distributed data structure (2006, background): “For example, there is a considerable amount of work on variants of Distributed Hash Tables (DHTs), including Chord [9, 19], Koorde [12], Pastry [17], Scribe [18], Symphony [13], and Tapestry [21], to name just a few.”