Non-transitive connectivity and DHTs (2005)
Cached
Download Links
by
Michael J. Freedman
,
Karthik Lakshminarayanan
,
Sean Rhea
,
Ion Stoica
| Venue: | In Proc. of the 2nd Workshop on Real Large Distributed Systems |
| Citations: | 33 - 3 self |
BibTeX
@INPROCEEDINGS{Freedman05non-transitiveconnectivity,
author = {Michael J. Freedman and Karthik Lakshminarayanan and Sean Rhea and Ion Stoica},
title = {Non-transitive connectivity and DHTs},
booktitle = {In Proc. of the 2nd Workshop on Real Large Distributed Systems},
year = {2005}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 partitioning. For example, the Chord DHT assigns each node
