Cluster-based Optimizations for Distributed Hash Tables [1 citations — 0 self]
|
Abstract:
We consider the problem of performing topological optimizations of distributed hash tables. Such hash tables include Chord and Tapestry and are a popular building block for distributed applications. Optimizing topologies over one dimensional hash spaces is particularly difficult as the higher dimensionality of the underlying network makes close fits unlikely. Instead, current schemes are limited to heuristically performing local optimizations finding the best of small random set of peers. We propose a new class of topology optimizations based on the existence of clusters of close overlay members within the underlying network. By constructing additional overlays for each cluster, a significant portion of the search procedure can be performed within the local cluster with a corresponding reduction in the search time. Finally, we discuss the effects of these additional overlays on spatial locality and other load balancing schemes. 1
Citations
| 2113 | Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications, 2001 – Stoica, Morris, et al. |
| 1749 | A scalable content-addressable network – Ratnasamy, Francis, et al. - 2001 |
| 581 | Wide-area cooperative storage with CFS – Dabek, Kaashoek, et al. - 2001 |
| 214 | Viceroy: A scalable and dynamic emulation of the butterfly – Malkhi, Naor, et al. |
| 192 | Topologicallyaware overlay construction and server selection,” 2002. [Online]. Available: citeseer.ist.psu.edu/ratnasamy02topologicallyaware.html – Ratnasamy, Handley, et al. |
| 180 | Probabilistic counting algorithms for data base applications – Flajolet, Martin - 1985 |
| 51 | Estimating simple functions on the union of data streams – Gibbons, Tirthapura - 2001 |
| 6 | Scalable peer-to-peer indexing with constant state – Considine, Florio - 2002 |
