Symphony: Distributed Hashing in a Small World Export

@inproceedings{symphony, 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.}, author = {Manku, Gurmeet S. and Bawa, Mayank and Raghavan, Prabhakar and Inc, Verity}, booktitle = {In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems}, citeulike-article-id = {5043125}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.1630}, pages = {127--140}, posted-at = {2009-07-02 19:01:18}, priority = {2}, title = {Symphony: Distributed Hashing in a Small World}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.1630}, year = {2003} }

TY - CONF ID - symphony L3 - citeulike-article-id:5043125 N2 - 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. EP - 140 TI - Symphony: Distributed Hashing in a Small World T2 - In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems SP - 127 AU - Manku, Gurmeet AU - Bawa, Mayank AU - Raghavan, Prabhakar AU - Inc, Verity PY - 2003/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.1630 ER -