|   | CMU-CS-03-171 Computer Science Department
 School of Computer Science, Carnegie Mellon University
 
    
     
 CMU-CS-03-171
 
Location-based Node IDs: Enabling Explicit Locality in DHTs 
Shuheng Zhou, Gregory R. Ganger, Peter Steenkiste 
September 2003  
CMU-CS-03-171.psCMU-CS-03-171.pdf
 Keywords:Distributed hash table, peer-to-peer, routing locality, 
hierarchical routing, content locality, load balance
 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.
 
18 pages 
 |