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.
|
2739
|
A mathematical theory of communication
– Shannon
- 1948
|
|
2113
|
Chord: A scalable peer-to-peer lookup service for internet applications
– Stoica, Morris, et al.
|
|
1749
|
A scalable content-addressable network
– Ratnasamy, Francis, et al.
- 2001
|
|
771
|
Information Theory and Reliable Communication
– Gallager
- 1968
|
|
768
|
Tapestry: An infrastructure for fault-tolerant wide-area location and routing
– Zhao, Kubiatowicz, et al.
- 2001
|
|
718
|
Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems
– Rowstron, Druschel
- 2001
|
|
643
|
Oceanstore: An architecture for global-scale persistent storage
– Kubiatowicz, Bindel, et al.
- 2000
|
|
581
|
Wide-area cooperative storage with CFS
– Dabek, Kaashoek, et al.
- 2001
|
|
578
|
A method for the construction of minimum redundancy codes
– Huffman
- 1952
|
|
452
|
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
– Rowstron, Druschel
- 2001
|
|
375
|
Accessing nearby copies of replicated objects in a distributed environment
– Plaxton, Rajaraman, et al.
- 1997
|
|
304
|
Predicting Internet Network Distance with Coordinates-Based Approaches
– Ng, Zhan
- 2002
|
|
192
|
Topologicallyaware overlay construction and server selection,” 2002. [Online]. Available: citeseer.ist.psu.edu/ratnasamy02topologicallyaware.html
– Ratnasamy, Handley, et al.
|
|
177
|
Skipnet: A scalable overlay network with practical locality properties
– Harvey, Jones, et al.
- 2003
|
|
152
|
The impact of DHT routing geometry on resilience and proximity
– Gummadi, Gummadi, et al.
- 2003
|
|
148
|
Arithmetic coding
– Langdon
- 1979
|
|
73
|
A routing underlay for overlay networks
– Nakao, Peterson, et al.
- 2003
|
|
64
|
A knowledge plane for the Internet
– Clark, Partridge, et al.
- 2003
|
|
31
|
On the Naming and Binding of Network Destinations
– Saltzer
- 1993
|
|
29
|
Replication Strategies for Highly Available Peer-to-peer Storage Systems
– Bhagwan, Savage, et al.
- 2002
|
|
22
|
Anne-Marie Kermarrec, Animesh Nandi, Antony Rowstron, and Atul Singh. SplitStream: High-Bandwidth Multicast in Cooperative Environments
– Castro, Druschel
|
|
15
|
Design and evaluation of a distributed scalable content discovery system
– Gao, Steenkiste
- 2004
|
|
9
|
and Farouk Kamoun. Hierarchical Routing for Large Networks, Performance Evaluation and Optimization. Published as Computer Networks
– Kleinrock
- 1977
|
|
6
|
Improving the routing and addressing of the Internet protocol
– Ford, Rekhter, et al.
- 1993
|
|
1
|
Consistent hashing and random trees: tools for relieving hot spots
– Levine, Lewin, et al.
- 1997
|
|
