|
USITS '03 Abstract
Symphony: Distributed Hashing in a Small World
Gurmeet Singh Manku and Mayank Bawa, Stanford University; Prabhakar Raghavan, Verity, Inc.
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.
- View the full text of this paper in PDF.
Until March 2004, you will need your USENIX membership identification in order to access the full papers. The Proceedings are published as a collective work, © 2003 by the USENIX Association. All Rights Reserved. Rights to individual papers remain with the author or the author's employer. Permission is granted for the noncommercial reproduction of the complete work for educational or research purposes. USENIX acknowledges all trademarks within this paper.
- If you need the latest Adobe Acrobat Reader, you can download it from Adobe's site.
|
Need help? Use our Contacts page.
