Ganesan, Prasanna and Gummadi, Krishna and Garcia-Molina, Hector (2004) Canon in G Major: Designing DHTs with Hierarchical Structure. In: 24th INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2004) , March 23-26, 2004, Tokyo, Japan.
This is the latest version of this item.
Distributed Hash Tables have been proposed as flat, non-hierarchical structures, in contrast to most scalable distributed systems of the past. We show how to construct hierarchical DHTs while retaining the homogeneity of load and functionality offered by flat designs. Our generic construction, Canon, offers the same routing state v/s routing hops trade-off provided by standard DHT designs. The advantages of Canon include (but are not limited to) (a) fault isolation, (b) efficient caching and effective bandwidth usage for multicast, (c) adaptation to the underlying physical network, (d) hierarchical storage of content, and (e) hierarchical access control. Canon can be applied to many different proposed DHTs to construct their Canonical versions. We show how four different DHTs---Chord, Symphony, CAN and Kademlia---can be converted into their Canonical versions that we call Crescendo, Cacophony, Can-Can and Kandy respectively.
|Item Type:||Conference or Workshop Item (Paper)|
|Additional Information:||The extended version of this paper is available on dbpubs as Publication 2003-74.|
|Related URLs:||Project Homepage||http://infolab.stanford.edu/peers/|
|Deposited By:||Import Account|
|Deposited On:||06 Jan 2004 16:00|
|Last Modified:||23 Dec 2008 08:51|
Available Versions of this Item
- Canon in G Major: Designing DHTs with Hierarchical Structure. (deposited 17 Dec 2003 16:00)
- Canon in G Major: Designing DHTs with Hierarchical Structure. (deposited 06 Jan 2004 16:00) [Currently Displayed]
Repository Staff Only: item control page