2006-05-191 Canon in G Major: Designing DHTs with Hierarchical Structure Prasanna Ganesan, Krishna Gummadi, Hector Garcia-Molina ICDCS2004 報告者 : 陳奕鈞.

Slides:

Advertisements

Similar presentations

Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.

Advertisements

Peer to Peer and Distributed Hash Tables

Scalable Content-Addressable Network Lintao Liu

P2P Systems and Distributed Hash Tables Section COS 461: Computer Networks Spring 2011 Mike Freedman

Flat Identifiers Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.

The Chord P2P Network Some slides have been borowed from the original presentation by the authors.

Lecture 5 - Routing On the Flat Labels M.Sc Ilya Nikolaevskiy Helsinki Institute for Information Technology (HIIT)

P2P Network Structured Networks: Distributed Hash Tables Pedro García López Universitat Rovira I Virgili

Xiaowei Yang CompSci 356: Computer Network Architectures Lecture 22: Overlay Networks Xiaowei Yang

Symphony: Distributed Hashing in a Small World Gurmeet Singh Manku Mayank Bawa Prabhakar Raghavan Presented by Satpreet Singh.

LightFlood: An Optimal Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.

Common approach 1. Define space: assign random ID (160-bit) to each node and key 2. Define a metric topology in this space,  that is, the space of keys.

Peer-to-Peer Networks as a Distribution and Publishing Model Jorn De Boever (june 14, 2007)

Distributed hash tables Protocols and applications Jinyang Li.

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

The Impact of DHT Routing Geometry on Resilience and Proximity New DHTs constantly proposed –CAN, Chord, Pastry, Tapestry, Plaxton, Viceroy, Kademlia,

YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology Qixiang Sun Prasanna Ganesan Hector Garcia-Molina Stanford University.

Topics in Reliable Distributed Systems Lecture 2, Fall Dr. Idit Keidar.

SkipNet: A Scalable Overlay Network with Practical Locality Properties Nick Harvey, Mike Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman Presented by.

Scalable Resource Information Service for Computational Grids Nian-Feng Tzeng Center for Advanced Computer Studies University of Louisiana at Lafayette.

Looking Up Data in P2P Systems Hari Balakrishnan M.Frans Kaashoek David Karger Robert Morris Ion Stoica.

Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications Stoica et al. Presented by Tam Chantem March 30, 2007.

Lee Center Workshop, May 19, 2006 Distributed Objects System with Support for Sequential Consistency.

P2P: Advanced Topics Filesystems over DHTs and P2P research Vyas Sekar.

The Impact of DHT Routing Geometry on Resilience and Proximity Krishna Gummadi, Ramakrishna Gummadi, Sylvia Ratnasamy, Steve Gribble, Scott Shenker, Ion.

Distributed Lookup Systems

University of Oregon Slides from Gotz and Wehrle + Chord paper

The Impact of DHT Routing Geometry on Resilience and Proximity Krishna Gummadi, Ramakrishna Gummadi, Sylvia Ratnasamy, Steve Gribble, Scott Shenker, Ion.

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

SkipNet: A Scaleable Overlay Network With Practical Locality Properties Presented by Rachel Rubin CS294-4: Peer-to-Peer Systems By Nicholas Harvey, Michael.

Topics in Reliable Distributed Systems Fall Dr. Idit Keidar.

1 CS 194: Distributed Systems Distributed Hash Tables Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and Computer.

CS 268: Overlay Networks: Distributed Hash Tables Kevin Lai May 1, 2001.

Beacon Vector Routing: Scalable Point-to-Point Routing in Wireless Sensornets.

Web Caching and CDNs March 3, Content Distribution Motivation –Network path from server to client is slow/congested –Web server is overloaded Web.

File Sharing : Hash/Lookup Yossi Shasho (HW in last slide) Based on Chord: A Scalable Peer-to-peer Lookup Service for Internet ApplicationsChord: A Scalable.

Network Layer (3). Node lookup in p2p networks Section in the textbook. In a p2p network, each node may provide some kind of service for other.

Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment Dewan Tanvir Ahmed and Shervin Shirmohammadi Distributed & Collaborative Virtual.

09/07/2004Peer-to-Peer Systems in Mobile Ad-hoc Networks 1 Lookup Service for Peer-to-Peer Systems in Mobile Ad-hoc Networks M. Tech Project Presentation.

CS An Overlay Routing Scheme For Moving Large Files Su Zhang Kai Xu.

DHTs and Peer-to-Peer Systems Supplemental Slides Aditya Akella 03/21/2007.

Chord & CFS Presenter: Gang ZhouNov. 11th, University of Virginia.

 A P2P IRC Network Built on Top of the Kademlia Distributed Hash Table.

The Impact of DHT Routing Geometry on Resilience and Proximity K. Gummadi, R. Gummadi..,S.Gribble, S. Ratnasamy, S. Shenker, I. Stoica.

Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications Xiaozhou Li COS 461: Computer Networks (precept 04/06/12) Princeton University.

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

1 Peer-to-Peer Systems. 2 Introduction What is peer One that of equal standing with another Peer-to-peer A way of structure distributed applications Each.

Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.

Networking 2012 On inter-domain name resolution for information-centric networks K.V. Katsaros, N. Fotiou, X. Vasilakos, C.N. Ververidis, C. Tsilopoulos,

Peer to Peer A Survey and comparison of peer-to-peer overlay network schemes And so on… Chulhyun Park

Lecture 12 Distributed Hash Tables CPE 401/601 Computer Network Systems slides are modified from Jennifer Rexford.

LightFlood: An Efficient Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.

Pastry Antony Rowstron and Peter Druschel Presented By David Deschenes.

A Comparative Study of the DNS Design with DHT-Based Alternatives 95/08/31 Chen Chih-Ming.

SYMBIOTIC ROUTING IN FUTURE DATA CENTER 工科三陳泰穎. Outline 1. CamCube 1. Traditional data center 2. The problems 3. CamCube philosophy 4. Feature 5. What’s.

Peer to Peer Network Design Discovery and Routing algorithms

CSE 486/586, Spring 2014 CSE 486/586 Distributed Systems Distributed Hash Tables Steve Ko Computer Sciences and Engineering University at Buffalo.

LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan M. Frans Kaashoek David Karger Robert Morris Ion Stoica MIT LCS.

Incrementally Improving Lookup Latency in Distributed Hash Table Systems Hui Zhang 1, Ashish Goel 2, Ramesh Govindan 1 1 University of Southern California.

Adlib : A Self-Tuning Index for Dynamic Peer-to-Peer Systems Proceedings of the 21st International Conference on Data Engineering(ICDE'05) Prasanna Ganesan.

Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications * CS587x Lecture Department of Computer Science Iowa State University *I. Stoica,

The Chord P2P Network Some slides taken from the original presentation by the authors.

Brocade: Landmark Routing on Overlay Networks

The Chord P2P Network Some slides have been borrowed from the original presentation by the authors.

Distributed Hash Tables

(slides by Nick Feamster)

A Scalable Content Addressable Network

Exploiting Routing Redundancy via Structured Peer-to-Peer Overlays

Consistent Hashing and Distributed Hash Table

P2P: Distributed Hash Tables

Presentation transcript:

Canon in G Major: Designing DHTs with Hierarchical Structure Prasanna Ganesan, Krishna Gummadi, Hector Garcia-Molina ICDCS2004 報告者 : 陳奕鈞

Outline Motivation Canon Crescendo Routing Crescendo Evaluation Conclusion

Motivation P-2-P Application –File sharing –Multi-media sharing –Collaborative computation –General purpose lookup directories

Canon Where is the paper “Canon in G Major”?

Hierarchy Design Single Point Over Head Isolating faults Adapting growth

Flat Design(DHT) No single point of failure

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

Canon System

Crescendo Chord Merged Chord

Chord Circular N-bit ID space Node x links to succ( )

Crescendo Merge –Merging multiple rings –Multi-level hierarchies Incremental –New node joins bottom up Links per node –log(n)

Merging Merging Rule –Each node m in one ring creates a link to a node n in the other ring iff. a.n is the closest node that is at least distance away for some b.n is closer to m than any node in m’s ring

Merging

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

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

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

Evaluation Links/node Hops/query latency

Number of Links vs. Number of Levels

Levels vs. Routing Hops

Path Locality

Conclusion –Novel Idea –Poor motivation