Computer Science Department
School of Computer Science, Carnegie Mellon University


Balancing Locality and Randomness in DHTs

Shuheng Zhou, Gregory R. Ganger, Peter Steenkiste

November 2003

Keywords: Distributed hash table, peer-to-peer, routing locality, content locality, load balance

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. 7 pages

Return to: SCS Technical Report Collection
School of Computer Science homepage

This page maintained by