Location-based Node IDs: Enabling Explicit Locality in DHTs

Carnegie Mellon University School of Computer Science Technical Report CMU-CS-03-171, September 2003.

Shuheng Zhou, Gregory R. Ganger, Peter Steenkiste*

Dept. of Electrical and Computer Engineering
School of Computer Science*
Carnegie Mellon University
Pittsburgh, PA 15213


Current peer-to-peer systems based on DHTs struggle with routing locality and content locality because of random node ID assignment. To address these issues, we promote the use of location-based node IDs to encode physical topology and improve routing. This gives applications explicit knowledge about and control over data locality at a coarse-grain. Applications can place content in particular regions or route towards a close replica. Schemes to address the difficulties that ensue, particularly load imbalance, are discussed.

KEYWORDS: distributed hash table, peer-to-peer, routing locality, hierarchical routing, content locality, load balance

FULL PAPER: pdf / postscript




© 2017. Last updated 15 March, 2012