Manku, Gurmeet and Bawa, Mayank and Raghavan, Prabhakar (2003) Symphony: Distributed Hashing in a Small World. Technical Report. Stanford InfoLab.
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.
|Item Type:||Techreport (Technical Report)|
|Subjects:||Computer Science > Distributed Systems|
|Related URLs:||Project Homepage||http://infolab.stanford.edu/peers/|
|Deposited By:||Import Account|
|Deposited On:||31 Mar 2004 16:00|
|Last Modified:||24 Dec 2008 10:29|
Repository Staff Only: item control page