1 / 21

Canon in G Major: Designing DHTs with Hierarchical Structure

Canon in G Major: Designing DHTs with Hierarchical Structure. Prasanna Ganesan(Stanford University) Krishna Gummadi(University of Washington) Hector Garcia-Molina(Stanford Universiy). Motivating Scenario. P-2-P Application File sharing Multi-media sharing Collaborative computation

maddy
Download Presentation

Canon in G Major: Designing DHTs with Hierarchical Structure

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Canon in G Major: Designing DHTs with Hierarchical Structure Prasanna Ganesan(Stanford University) Krishna Gummadi(University of Washington) Hector Garcia-Molina(Stanford Universiy)

  2. Motivating Scenario • P-2-P Application • File sharing • Multi-media sharing • Collaborative computation • General purpose lookup directories

  3. Motivating Scenario Where is the paper “Canon in G Major”?

  4. Hierarchy Design • Isolating faults • Adapting growth Single Point Over Head

  5. Flat Design(DHT) • No single point of failure

  6. Flat & Hierarchical Design • Flat Design • No single point of failure • P2P(DHT) • Hierarchical Design • Isolating faults • Adapting growth • DNS

  7. Canonical System

  8. Crescendo Merged Chord Chord Chord

  9. Chord • Circular N-bit ID space • Node x links to succ(x+2^i)

  10. Crescendo • Merge • Merging multiple rings • Multi-level hierarchies • Incremental • New node joins bottom up • Links per node • Log(n)

  11. Merging

  12. Merging • Merging Rule • Closer than any other black node • Y=succ(x+2^i)

  13. Routing Crescendo(intra-domain) 0 -> 12 Greedy Clockwise routing Path Locality -Fault isolation -Security -Efficiency

  14. Routing Crescendo(inter-domain) 0 -> 13 5 -> 13 Path convergence :closest node to destination in the domain :same destination node same last node in the domain -Distributed Caching -Bandwidth savings

  15. Other DHTs • Chord => Crescendo • CAN => Can-Can • Symphony => Cacophony • Kademlia => Kandy

  16. Evaluation • Links/node • Hops/query • latency

  17. Number of Links vs. Number of Levels

  18. Levels vs. Routing Hops

  19. Path Locality

  20. Critique • Strong point • Novel Idea • Good development of idea • Weak point • Poor motivating scenario

  21. New Idea • Do you have any New Idea?

More Related