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

Slides:

Advertisements

Similar presentations

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

Advertisements

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

Scalable Content-Addressable Network Lintao Liu

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

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)

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,

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

Introduction to Peer-to-Peer (P2P) Systems Gabi Kliot - Computer Science Department, Technion Concurrent and Distributed Computing Course 28/06/2006 The.

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.

FreeNet: A Distributed Anonymous Information Storage and Retrieval System Ian Clark, Oskar Sandberg, Brandon Wiley and Theodore Hong.

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.

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

Distributed Lookup Systems

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.

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

Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications 吳俊興國立高雄大學資訊工程學系 Spring 2006 EEF582 – Internet Applications and Services 網路應用與服務.

Or, Providing Scalable, Decentralized Location and Routing Network Services Tapestry: Fault-tolerant Wide-area Application Infrastructure Motivation and.

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.

Announcements List Lab is still under construction Next session we will have paper discussion, assign papers,

Storage management and caching in PAST PRESENTED BY BASKAR RETHINASABAPATHI 1.

Introduction to Peer-to-Peer Networks. What is a P2P network Uses the vast resource of the machines at the edge of the Internet to build a network that.

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.

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.

Introduction to Peer-to-Peer Networks. What is a P2P network A P2P network is a large distributed system. It uses the vast resource of PCs distributed.

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

Cooperative File System. So far we had… - Consistency BUT… - Availability - Partition tolerance ?

Content Overlays (Nick Feamster). 2 Content Overlays Distributed content storage and retrieval Two primary approaches: –Structured overlay –Unstructured.

 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, Krishna Gummadi, Hector Garcia-Molina ICDCS2004 報告者 : 陳奕鈞.

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

Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.

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

Paper Survey of DHT Distributed Hash Table. Usages Directory service  Very little amount of information, such as URI, metadata, … Storage  Data, such.

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.

1 Distributed Hash Table CS780-3 Lecture Notes In courtesy of Heng Yin.

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

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

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.

1 Secure Peer-to-Peer File Sharing Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, Hari Balakrishnan MIT Laboratory.

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.

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)

Plethora: Infrastructure and System Design

Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service

Exploiting Routing Redundancy via Structured Peer-to-Peer Overlays

Consistent Hashing and Distributed Hash Table

Presentation transcript:

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 –General purpose lookup directories

Motivating Scenario 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

Canonical System

Crescendo Chord Merged Chord

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

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

Merging

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

Routing Crescendo (intra-domain) Greedy Clockwise routing Path Locality -Fault isolation -Security -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

Critique Strong point –Novel Idea –Good development of idea Weak point –Poor motivating scenario

New Idea Do you have any New Idea?