Stanford InfoLab Publication Server

Canon in G Major: Designing DHTs with Hierarchical Structure

Ganesan, Prasanna and Gummadi, Krishna and Garcia-Molina, Hector (2003) Canon in G Major: Designing DHTs with Hierarchical Structure. Technical Report. Stanford.

WarningThere is a more recent version of this item available.



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:Techreport (Technical Report)
Subjects:Computer Science > Distributed Systems
Related URLs:Project Homepage
ID Code:626
Deposited By:Import Account
Deposited On:17 Dec 2003 16:00
Last Modified:24 Dec 2008 09:49

Available Versions of this Item

Download statistics

Repository Staff Only: item control page