Symphony: Distributed Hashing in a Small World

By Gurmeet Singh Manku, Mayank Bawa, Prabhakar Raghavan. USENIX Symposium on Internet Technologies and Systems, 2003

530 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/bd36c1f80aa7aad40cb7d6bfaae29f078b72a630

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

OverSim: A Flexible Overlay Network Simulation Framework (2007, methodology): “In addition to the overlay protocols Chord [9] and Symphony [10] there are several services like CAST and DHT available on application layer.”
The rainbow skip graph: a fault-tolerant constant-degree distributed data structure (2006, background): “For example, there is a considerable amount of work on variants of Distributed Hash Tables (DHTs), including Chord [9, 19], Koorde [12], Pastry [17], Scribe [18], Symphony [13], and Tapestry [21], to name just a few.”
Survey of research towards robust peer-to-peer networks: Search methods (2006, methodology): “While it does not use hashing, Mercury is loosely similar to the DHT approaches: nodes within hubs are arranged into rings, like Chord [34]; for efficient routing within hubs, k long-distance links are used, like Symphony [339].”
Mercury: supporting scalable multi-attribute range queries (2004, background): “Our analysis, based on analyzing possible strawman designs using DHTs, indicates that the abstractions provided by a DHT are not enough for implementing range queries.”
In VINI veritas: realistic and controlled network experimentation (2006, methodology): “The hybrid approach in [22] works like descriptor based LAC, but determines a feasible degree of overbooking which is obtained through measurement experience from the past.”
A scalable distributed information management system (2004, background): “Recent research in peer-to-peer structured networks resulted in Distributed Hash Tables (DHTs) [1, 16, 17, 21, 23, 26, 27 , 29, 32, 33, 36, 40, 47]—a data structure that scales with the number of nodes and that distributes the read-write load for different queries among the participating nodes.”
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience (2003, methodology): “We leave a thorough analysis of numerous recently proposed graphs [15], [22], [27], [29], [44], [46] for future work and conduct a detailed study of two classical approaches Chord [43] and CAN [34] in sections 4-6.”