DMCA
Symphony: Distributed Hashing in a Small World (2003)
| Venue: | IN PROCEEDINGS OF THE 4TH USENIX SYMPOSIUM ON INTERNET TECHNOLOGIES AND SYSTEMS |
| Citations: | 211 - 13 self |
BibTeX
@INPROCEEDINGS{Manku03symphony:distributed,
author = {Gurmeet Singh Manku and Mayank Bawa and Prabhakar Raghavan},
title = {Symphony: Distributed Hashing in a Small World},
booktitle = {IN PROCEEDINGS OF THE 4TH USENIX SYMPOSIUM ON INTERNET TECHNOLOGIES AND SYSTEMS},
year = {2003},
pages = {127--140},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present Symphony, a novel protocol for maintaining distributed hash tables in a wide area network. The key idea is to arrange all participants along a ring and equip them with long distance contacts drawn from a family of harmonic distributions. Through simulation, we demonstrate that our construction is scalable, flexible, stable in the presence of frequent updates and offers small average latency with only a handful of long distance links per node. The cost of updates when hosts join and leave is small.
