Coral: A Peer-to-peer Content Distribution Network

Slides:



Advertisements
Similar presentations
Information-Centric Networks05c-1 Week 5 / Paper 3 Democratizing content publication with Coral –Michael J. Freedman, Eric Freudenthal, David Mazières.
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.
Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.
Scalable Content-Addressable Network Lintao Liu
Peer-to-Peer (P2P) Distributed Storage 1Dennis Kafura – CS5204 – Operating Systems.
Chord: A scalable peer-to- peer lookup service for Internet applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashock, Hari Balakrishnan.
Democratizing Content Publication with Coral Mike Freedman Eric Freudenthal David Mazières New York University NSDI 2004.
Content Distribution Networks Costin Raiciu Advanced Topics in Distributed Systems Fall 2012.
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.
1 Content Delivery Networks iBAND2 May 24, 1999 Dave Farber CTO Sandpiper Networks, Inc.
1 Routing and Scheduling in Web Server Clusters. 2 Reference The State of the Art in Locally Distributed Web-server Systems Valeria Cardellini, Emiliano.
Small-world Overlay P2P Network
Spring 2003CS 4611 Content Distribution Networks Outline Implementation Techniques Hashing Schemes Redirection Strategies.
Distributed hash tables Protocols and applications Jinyang Li.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems Presented by: Lin Wing Kai.
Kyushu University Graduate School of Information Science and Electrical Engineering Department of Advanced Information Technology Supervisor: Professor.
Flash Crowds And Denial of Service Attacks: Characterization and Implications for CDNs and Web Sites Aaron Beach Cs395 network security.
Squirrel: A decentralized peer- to-peer web cache Paul Burstein 10/27/2003.
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.
Wide-area cooperative storage with CFS
Web Caching and CDNs March 3, Content Distribution Motivation –Network path from server to client is slow/congested –Web server is overloaded Web.
Content Networking - CON Content Overlay Network Vishal Kumar Singh Eilon Yardeni April, 28 th 2005.
Content Delivery Networks. History Early 1990s sees 100% growth in internet traffic per year 1994 o Netscape forms and releases their first browser.
World Wide Web Caching: Trends and Technology Greg Barish and Katia Obraczka USC Information Science Institute IEEE Communications Magazine, May 2000 Presented.
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
Caching and Content Distribution Networks. Web Caching r As an example, we use the web to illustrate caching and other related issues browser Web Proxy.
Web Cache. Introduction what is web cache?  Introducing proxy servers at certain points in the network that serve in caching Web documents for faster.
1 Content Distribution Networks. 2 Replication Issues Request distribution: how to transparently distribute requests for content among replication servers.
On the Use and Performance of Content Distribution Networks Balachander Krishnamurthy Craig Wills Yin Zhang Presenter: Wei Zhang CSE Department of Lehigh.
{ Content Distribution Networks ECE544 Dhananjay Makwana Principal Software Engineer, Semandex Networks 5/2/14ECE544.
Oasis: Anycast for Any Service Michael J. Freedman Karthik Lakshminarayanan David Mazières in NSDI 2006 Presented by: Sailesh Kumar.
PIC: Practical Internet Coordinates for Distance Estimation Manuel Costa joint work with Miguel Castro, Ant Rowstron, Peter Key Microsoft Research Cambridge.
Travis Portz.  Large, sudden increases in the traffic to a website  Low-traffic website being linked to by a popular news feed  “Slashdot Effect” 
World Wide Web Caching: Trends and Technologys Gerg Barish & Katia Obraczka USC Information Sciences Institute, USA,2000.
2: Application Layer1 Chapter 2 outline r 2.1 Principles of app layer protocols r 2.2 Web and HTTP r 2.3 FTP r 2.4 Electronic Mail r 2.5 DNS r 2.6 Socket.
Application of Content Computing in Honeyfarm Introduction Overview of CDN (content delivery network) Overview of honeypot and honeyfarm New redirection.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.
Kaleidoscope – Adding Colors to Kademlia Gil Einziger, Roy Friedman, Eyal Kibbar Computer Science, Technion 1.
PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System Computer Science Department College of William and Mary Lei Guo, Songqing Chen, and Xiaodong.
Computer Science Lecture 14, page 1 CS677: Distributed OS Last Class: Concurrency Control Concurrency control –Two phase locks –Time stamps Intro to Replication.
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
Information-Centric Networks Section # 5.3: Content Distribution Instructor: George Xylomenos Department: Informatics.
Peer to Peer Network Design Discovery and Routing algorithms
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan M. Frans Kaashoek David Karger Robert Morris Ion Stoica MIT LCS.
Content Delivery Networks: Status and Trends Speaker: Shao-Fen Chou Advisor: Dr. Ho-Ting Wu 5/8/
INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.
09/13/04 CDA 6506 Network Architecture and Client/Server Computing Peer-to-Peer Computing and Content Distribution Networks by Zornitza Genova Prodanoff.
Large Scale Sharing Marco F. Duarte COMP 520: Distributed Systems September 19, 2004.
On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.
Performance Evaluation of Redirection Schemes in Content Distribution Networks Jussi Kangasharju, Keith W. Ross Institut Eurecom Jim W. Roberts France.
Democratizing content publication with Coral M.J. Freedman et. al.
Content Distribution Networks
DNS-sly: Avoiding Censorship through Network Complexity
Ad-blocker circumvention System
Utilization of Azure CDN for the large file distribution
Plethora: Infrastructure and System Design
EE 122: Peer-to-Peer (P2P) Networks
COS 518: Advanced Computer Systems Lecture 9 Michael Freedman
Be Fast, Cheap and in Control
Edge computing (1) Content Distribution Networks
CS 162: P2P Networks Computer Science Division
DotSlash: An Automated Web Hotspot Rescue System
Content Distribution Networks
IPFS: Interplanetary File Systems
Caching 50.5* + Apache Kafka
Kademlia: A Peer-to-peer Information System Based on the XOR Metric
Presentation transcript:

Coral: A Peer-to-peer Content Distribution Network Michael J. Freedman, Eric Freudenthal, and David Mazières In Proc. 1st USENIX/ACM Symposium on Networked Systems Design and Implementation, San Francisco, CA, March 2004. Presented By: Devdutta Bhosale CS 5204 Operating Systems November 11, 2004

Outline What is a CDN and why do we need it ? Shortcomings of current approach Coral Design Key Ideas - DSHT, DNS, Routing and Clustering Evaluation Summary and Conclusion CS 5204 Operating Systems November 11, 2004

Slashdot Effect Some sites witness a sudden surge in traffic when popular web sites posts messages/articles that contain references to them. This sudden increase in the number of hits to a web site is known as the Slashdot effect, the name derived from a well-known technology news discussion site Slashdot. Result: Website becomes very slow or goes down and .. Overall increase in Internet traffic. CS 5204 Operating Systems November 11, 2004

What is a Content Distribution Network What is a Content Distribution Network ? Serve Content from a location that is ‘closer’ to a client so as to minimize load on the origin servers. CS 5204 Operating Systems November 11, 2004

Problems with CDNs High cost of operation: $1500 for every Mbps served. Targeted only for commercial and big websites. Can we get the advantages of commercial CDNs for free ? CS 5204 Operating Systems November 11, 2004

Coral’s Approach Wouldn’t it be nice to host a website capable of serving at 10 Mbps when the actual uplink capacity to the Internet is only 256 Kbps ?? Wow !! That’s great but how do we do it.. CS 5204 Operating Systems November 11, 2004

Coral Approach Coral Coral Coral 9 Coral 4 8 11:Store 4 Coral Coral 7 2 3 5 1 10 Resolver 6 Browser www.cnn.com.nyud.net:8090 CS 5204 Operating Systems November 11, 2004

Coral’s Approach Use every node participating in the system to serve content. Use locality of the client to serve content from a location that is closer to the client. Avoid hot spots within Coral. CS 5204 Operating Systems November 11, 2004

Coral Components Coral consists of three main components. Coral Indexing Infrastructure DNSSRV HTTPProxy CS 5204 Operating Systems November 11, 2004

Key Contributions First Completely decentralized and self-organizing web-content distribution network. First P2P DNS redirection Self Organizing clusters of nodes CS 5204 Operating Systems November 11, 2004

Key Design Ideas DSHT: Distributed sloppy hash table P2P DNS System Clustering Mechanism to exploit locality Hotspot aware Routing CS 5204 Operating Systems November 11, 2004

DSHT Motivation With earlier DHTs one key maps to one node. i.e. URL  Location of Node Storing the page. If multiple nodes are storing the same URL we can have URL  List of nodes storing the page. What happens when list gets updated very frequently. CS 5204 Operating Systems November 11, 2004

DSHT Motivation Any node requesting some content is likely to cache that content which is a multiple reader-writer problem. Allow multiple values to be associated with a key. Each node stores only a maximum no. of values per key. Client Server New Writer CS 5204 Operating Systems November 11, 2004

Coral Clusters Clusters are used to group topologically close nodes. Coral P2P components are arranged in the form of clusters. Each cluster is characterized by maximum desired network RTT called as diameter. Hierarchy of different diameter clusters is known as levels. Every node is a member of one cluster at each level. There are multiple clusters of levels 2 and 1while there is only cluster of level-0. Cluster arrangement changes dynamically. (split, merge) CS 5204 Operating Systems November 11, 2004

Coral Clusters CS 5204 Operating Systems November 11, 2004

Coral Clusters CS 5204 Operating Systems November 11, 2004

P2P DNS Server probes client Server probes client to determine the RTT and then return a proxy who is below that level. Server probes client Browser Coral httpprx dnssrv Resolver Coral Proxy CS 5204 Operating Systems November 11, 2004

P2P DNS The closer the dnssrv to client the better is the selection of CoralProxy. In the AUTHORITY section of the DNS reply it sends the DNS server addresses which are close to the client so that future DNS requests will be resolved by that server. CS 5204 Operating Systems November 11, 2004

Coral Routing - XOR Metric Nodes and Keys are both 160-bit. Distance between a key and a node is XOR of their IDs. IDs with longer matching prefixes are numerically closer. If a distance has one fewer bit than other it means it is at least halfway close. (Binary Property) CS 5204 Operating Systems November 11, 2004

Coral Routing 1110 XOR 0100: 1010 0000 XOR 0100: 0100 NODEID KEY: Distance 1110 XOR 0100: 1010 0000 XOR 0100: 0100 0101 XOR 0100: 0001 0100 XOR 0100: 0000 CS 5204 Operating Systems November 11, 2004

How does Coral Prevent Hotpots ? Store value once in each level cluster Always storing at closest node causes hotspot Halt put routing at full and loaded node (use of stack) Full → M vals/key with TTL > ½ insertion TTL Loaded → β requests in past minute Cache Key/Value pairs at a node close to the key being referenced. CS 5204 Operating Systems November 11, 2004

Evaluation We can evaluate Coral by how it achieves following objectives 1. Reduction in load on servers, solving the “flash crowd” problem. 2. Clustering provides performance gains for popular data, resulting in good client performance. 3. Ability to naturally forms suitable clusters. 4. Preventing hot spots within its indexing system. CS 5204 Operating Systems November 11, 2004

Experimental Setup On 166 machine in North America and Europe, Coral Daemons, DNS servers and HTTP proxies are started. Origin server has an upstream bandwidth of 384 kbps serving 12 different 41 kb files. Client processes are launched on all the machines requesting images for 30 minutes. Total load on the system is 32800 Kb/s. CS 5204 Operating Systems November 11, 2004

Server Load Coral Hits in 20ms Cluster Local Caches begin to Handle requests. Hits to Ori- -gin server CS 5204 Operating Systems November 11, 2004

Summary and Conclusions Provides non-standard P2P storage abstraction Prevents hotspots Solves Slashdot effect Cheap option to traditional CDNs CS 5204 Operating Systems November 11, 2004

Cons Difficult to guarantee a minimum quality of service as offered by tradition CDNs Cannot serve dynamic content Security Behavior of the system varies as the nodes join and leave the system Latency: 50 % clients experienced a latency of 3 seconds but paper does not talk about the latency without Coral CS 5204 Operating Systems November 11, 2004

Questions ?? CS 5204 Operating Systems November 11, 2004