CategoryValue
Available viahttp://dbpubs.stanford.edu/pub/2003-74
Next version(s) 2004-2
Submitted on 18th of December 2003
Author Ganesan, Prasanna; Gummadi, Krishna; Garcia-Molina, Hector
Title Canon in G Major: Designing DHTs with Hierarchical Structure
Date of publication 2003
Published in Technical Report.
Citation Ganesan, Prasanna; Gummadi, Krishna; Garcia-Molina, Hector. Canon in G Major: Designing DHTs with Hierarchical Structure, Technical Report.
Number of pages 15
Language English
Project Peers
Type Technical Report
Subject group Distributed Systems
Abstract 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.
Fulltext source
  • Postscript (ps, ps.gz, ps.zip)
  • PDF (pdf, pdf.gz, pdf.zip)
  • Management of the document bysiroker@db.stanford.edu


    Stanford InfoLab Publication Server