A Scalable Content Addressable Network

Slides:

Advertisements

Similar presentations

Topology-Aware Overlay Construction and Server Selection Sylvia Ratnasamy Mark Handley Richard Karp Scott Shenker Infocom 2002.

Advertisements

CAN 1.Distributed Hash Tables a)DHT recap b)Uses c)Example – CAN.

Peer to Peer and Distributed Hash Tables

Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.

Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK

Scalable Content-Addressable Network Lintao Liu

Topologically-Aware Overlay Construction and Server Selection Sylvia Ratnasamy, Mark Handly, Richard Karp and Scott Shenker Presented by Shreeram Sahasrabudhe.

Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Schenker Presented by Greg Nims.

Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.

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.

Small-world Overlay P2P Network

Presented by Elisavet Kozyri. A distributed application architecture that partitions tasks or work loads between peers Main actions: Find the owner of.

A Scalable Content Addressable Network (CAN)

Peer to Peer File Sharing Huseyin Ozgur TAN. What is Peer-to-Peer?  Every node is designed to(but may not by user choice) provide some service that helps.

Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker A Scalable, Content- Addressable Network (CAN) ACIRI U.C.Berkeley Tahoe Networks.

A Scalable Content Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker Presented by: Ilya Mirsky, Alex.

A Scalable Content-Addressable Network Authors: S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker University of California, Berkeley Presenter:

Distributed Lookup Systems

A Scalable Content- Addressable Network Sections: 3.1 and 3.2 Καραγιάννης Αναστάσιος Α.Μ. 74.

1 A Scalable Content- Addressable Network S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker Proceedings of ACM SIGCOMM ’01 Sections: 3.5 & 3.7.

1 Load Balance and Efficient Hierarchical Data-Centric Storage in Sensor Networks Yao Zhao, List Lab, Northwestern Univ Yan Chen, List Lab, Northwestern.

Content Addressable Networks. CAN Associate with each node and item a unique id in a d-dimensional space Goals –Scales to hundreds of thousands of nodes.

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

1 Load Balance and Efficient Hierarchical Data-Centric Storage in Sensor Networks Yao Zhao, List Lab, Northwestern Univ Yan Chen, List Lab, Northwestern.

Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker A Scalable, Content- Addressable Network ACIRI U.C.Berkeley Tahoe Networks 1.

A Scalable Content-Addressable Network

Topology-Aware Overlay Networks By Huseyin Ozgur TAN.

Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker A Scalable, Content- Addressable Network ACIRI U.C.Berkeley Tahoe Networks 1.

Structured P2P Network Group14: Qiwei Zhang; Shi Yan; Dawei Ouyang; Boyu Sun.

1 A scalable Content- Addressable Network Sylvia Rathnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker Pirammanayagam Manickavasagam.

Roger ZimmermannCOMPSAC 2004, September 30 Spatial Data Query Support in Peer-to-Peer Systems Roger Zimmermann, Wei-Shinn Ku, and Haojun Wang Computer.

Other Structured P2P Systems CAN, BATON Lecture 4 1.

CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker.

GeoGrid: A scalable Location Service Network Authors: J.Zhang, G.Zhang, L.Liu Georgia Institute of Technology presented by Olga Weiss Com S 587x, Fall.

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

Applied Research Laboratory David E. Taylor A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker.

Sylvia Ratnasamy (UC Berkley Dissertation 2002) Paul Francis Mark Handley Richard Karp Scott Shenker A Scalable, Content Addressable Network Slides by.

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

Vincent Matossian September 21st 2001 ECE 579 An Overview of Decentralized Discovery mechanisms.

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

Content Addressable Network CAN. The CAN is essentially a distributed Internet-scale hash table that maps file names to their location in the network.

A Scalable Content-Addressable Network (CAN) Seminar “Peer-to-peer Information Systems” Speaker Vladimir Eske Advisor Dr. Ralf Schenkel November 2003.

Peer Pressure: Distributed Recovery in Gnutella Pedram Keyani Brian Larson Muthukumar Senthil Computer Science Department Stanford University.

Content Addressable Networks CAN is a distributed infrastructure, that provides hash table-like functionality on Internet-like scales. Keys hashed into.

Scalable Content- Addressable Networks Prepared by Kuhan Paramsothy March 5, 2007.

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

P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,

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

Building Low-maintenance Expressways for P2P Systems Zhichen Xu and Zheng Zhang Presented By Swetha Boinepally.

Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.

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

Topologically-Aware Overlay Construction and Sever Selection Sylvia Ratnasamy, Mark Handley, Richard Karp, Scott Shenker.

Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks

Peer-to-Peer Networks 03 CAN (Content Addressable Network) Christian Schindelhauer Technical Faculty Computer-Networks and Telematics University of Freiburg.

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

Two Peer-to-Peer Networking Approaches Ken Calvert Net Seminar, 23 October 2001 Note: Many slides “borrowed” from S. Ratnasamy’s Qualifying Exam talk.

1 Distributed Hash Tables and Structured P2P Systems Ningfang Mi September 27, 2004.

CSCI 599: Beyond Web Browsers Professor Shahram Ghandeharizadeh Computer Science Department Los Angeles, CA

Simple Load Balancing for Distributed Hash tables

Controlling the Cost of Reliability in Peer-to-Peer Overlays

Plethora: Infrastructure and System Design

Accessing nearby copies of replicated objects

Zhichen Xu, Mallik Mahalingam, Magnus Karlsson

SCOPE: Scalable Consistency in Structured P2P Systems

A Scalable content-addressable network

CONTENT ADDRESSABLE NETWORK

A Scalable, Content-Addressable Network

Reading Report 11 Yin Chen 1 Apr 2004

A Scalable, Content-Addressable Network

Presentation transcript:

A Scalable Content Addressable Network (Sigcomm 2001) Authors: Sylvia Ratsanamy, Mark Handley, Paul Francis Richard Karp, Scott Shenker Ehsan Foroughi

Outline Introduction Design Improvements Logical Environment Find and Insert Operations Departure and Recovery Improvements

Introduction Large Scale Addressing/Storage Management Key Features: Distributable/Scalable Fault Tolerance Fast Access vs. Low Overhead Hash Tables: How to distribute them?

Basic Design Logical Hash Space Keys hash to a d-dimensional Cartesian co-ordinate space on a d-torus The space is partitioned into distinct zones Zones are d-dimensional rectangles Zones are neighbor if share in (d-1) dimention

d-dimensional Torus Y X 1.0 0, 0 0.5

Routing Queries are hashed to the space, then routed to the node that handles the destination point on the virtual space Each node maintains information about its neighbors Routing is greedy, i.e. the query is forwarded to the neighbor with least distance to destination

Example of Routing

Insertion Find an arbitrary node of the system Pick a random key and hash it to some point Find the owner of the zone using the routing mechanism Start to Join Split P

Insertion cont’d Split the destination zone Take over a half of the new zone Update the neighbor information lists both on new zones and all neighbors of the old zone New Zone

Operation Cost Average path length is (d/2)(n1/d) hops Average neighbor list is 2d Letting d=log n both average path length and neighbor list will be O( log n )

Departure & Recovery Departure can be With previous warning Sudden death In case of normal departure, the node will explicitly hand out the zone to one of its neighbors and the depart Under normal conditions, nodes transmit update message so that neighbors will know when someone is dead using a timeout timer and ping!

Recovery In case of abnormal departure, the neighbors decide who should TAKEOVER the zone (node with smallest zone) In both case, some nodes may handle more than one zone temporarily Massive cluster failures can bring CAN to an inconsistent state! (not very probable)

Zone Reassignment Fragmentation problem due to departure of nodes A background algorithm reassigns zone and tries to merge-up zones to reduce the number of zones each node handles

Improvements Multi-Dimension Metrics Multi-Coordinate Spaces Overloading the Zones Multiple Hash Functions Topologically Sensitive Construction Uniform Partitioning Caching

Conclusion Drawbacks Applications Not possible to increase dimension Physical neighboring vs. logical neighboring Applications P2P File Sharing DNS …