usenix conference policies
Symphony: Distributed Hashing in a Small World
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, exible, 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.
BibTeX
@inproceedings {270394,
author = {Gurmeet Singh Manku and Mayank Bawa},
title = {Symphony: Distributed Hashing in a Small World},
booktitle = {4th USENIX Symposium on Internet Technologies and Systems (USITS 03)},
year = {2003},
address = {Seattle, WA},
url = {https://www.usenix.org/conference/usits-03/symphony-distributed-hashing-small-world},
publisher = {USENIX Association},
month = mar
}
author = {Gurmeet Singh Manku and Mayank Bawa},
title = {Symphony: Distributed Hashing in a Small World},
booktitle = {4th USENIX Symposium on Internet Technologies and Systems (USITS 03)},
year = {2003},
address = {Seattle, WA},
url = {https://www.usenix.org/conference/usits-03/symphony-distributed-hashing-small-world},
publisher = {USENIX Association},
month = mar
}
connect with us