Non-transitive connectivity and DHTs
Michael J. Freedman, Karthik Lakshminarayanan, Sean C. Rhea, Ion Gabriel Stoica · 2005
The most basic functionality of a distributed hash table, or DHT, is to partition a key space across the set of nodes in a distributed system such that all nodes agree on the par-titioning. For example, the Chord DHT assigns each node