Balancing Locality and Randomness in DHTs
Carnegie Mellon University School of Computer Science Technical Report CMU-CS-03-203, November, 2003.
Shuheng Zhou, Gregory R. Ganger, Peter Steenkiste*
Electrical and Computer Engineering
School of Computer Science*
Carnegie Mellon University
Pittsburgh, PA 15213
Embedding locations in DHT node IDs makes locality explicit and, thereby, enables engineering of the trade-off between careful placement and randomized load balancing. This paper discusses hierarchical, topology-exposed DHTs and their benefits for content locality, and administrative control and routing locality.
KEYWORDS: distributed hash table, peer-to-peer, routing locality, content locality, load balance