The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Efficient topology-aware overlay network
ACM SIGCOMM Computer Communication Review
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Designing a DHT for low latency and high throughput
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Build One, Get One Free: Leveraging the Coexistence of Multiple P2P Overlay Networks
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Flower-CDN: a hybrid P2P overlay for efficient query processing in CDN
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Network coordinates in the wild
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
| Hi-index | 0.00 |
Large-scale distributed hash tables (DHT) are typically implemented without respect to node location or characteristics, thus producing physically long routes and squandering network resources. Some systems have integrated round trip times through proximity-aware identifier selection (PIS), proximity-aware route selection (PRS), and proximity-aware neighbor selection (PNS). While PRS and PNS tend to optimize existing systems, PIS deterministically selects node identifiers based on physical node location, leading to a loss of scalability and robustness. The trade off between the scalability and robustness gained from a DHT's randomness and the better allocation of network resources that comes with a location-aware, deterministically structured DHT make it difficult to design a system that is both robust and scalable and resource conserving. We present initial ideas for the construction of a small-world DHT which mitigates this trade off by retaining scalability and robustness while effectively integrating round trip times and additional node quality with the help of Vivaldi network coordinates.