Spring 2003CS 4611 Content Distribution Networks Outline Implementation Techniques Hashing Schemes Redirection Strategies.

Slides:



Advertisements
Similar presentations
Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
Advertisements

Scheduling in Web Server Clusters CS 260 LECTURE 3 From: IBM Technical Report.
Information-Centric Networks05c-1 Week 5 / Paper 3 Democratizing content publication with Coral –Michael J. Freedman, Eric Freudenthal, David Mazières.
1 Server Selection & Content Distribution Networks (slides by Srini Seshan, CS CMU)
Democratizing Content Publication with Coral Mike Freedman Eric Freudenthal David Mazières New York University NSDI 2004.
Latency-sensitive hashing for collaborative Web caching Presented by: Xin Qi Yong Yang 09/04/2002.
Scalable Content-aware Request Distribution in Cluster-based Network Servers Jianbin Wei 10/4/2001.
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.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
Internet Networking Spring 2006 Tutorial 12 Web Caching Protocols ICP, CARP.
An Analysis of Internet Content Delivery Systems Stefan Saroiu, Krishna P. Gommadi, Richard J. Dunn, Steven D. Gribble, and Henry M. Levy Proceedings of.
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #13 Web Caching Protocols ICP, CARP.
CDNs & Replication Prof. Vern Paxson EE122 Fall 2007 TAs: Lisa Fowler, Daniel Killebrew, Jorge Ortiz.
Flash Crowds And Denial of Service Attacks: Characterization and Implications for CDNs and Web Sites Aaron Beach Cs395 network security.
Anycast Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
Internet Networking Spring 2002 Tutorial 13 Web Caching Protocols ICP, CARP.
1 The Effectiveness of Request Redirection on CDN Robustness Limin Wang, Vivek Pai and Larry Peterson Presented by: Eric Leshay Ian McBride Kai Rasmussen.
Squirrel: A decentralized peer- to-peer web cache Paul Burstein 10/27/2003.
1 Web Content Delivery Reading: Section and COS 461: Computer Networks Spring 2007 (MW 1:30-2:50 in Friend 004) Ioannis Avramopoulos Instructor:
Web Caching and CDNs March 3, Content Distribution Motivation –Network path from server to client is slow/congested –Web server is overloaded Web.
World Wide Web Caching: Trends and Technology Greg Barish and Katia Obraczka USC Information Science Institute IEEE Communications Magazine, May 2000 Presented.
Content Distribution Networks (CDNs) Mike Freedman COS 461: Computer Networks Lectures: MW 10-10:50am in Architecture N101
CSCI-1680 Web Performance and Content Distribution Based partly on lecture notes by Scott Shenker and John Jannotti Rodrigo Fonseca.
Content Distribution Network (CDN) Performance Punit Shah CSE581 Internet Technologies OGI, OHSU 2002, Jan 16th.
Information-Centric Networks05a-1 Week 5 / Paper 1 On the use and performance of content distribution networks –Balachander Krishnamurthy, Craig Wills,
Web Server Load Balancing/Scheduling Asima Silva Tim Sutherland.
Storage management and caching in PAST PRESENTED BY BASKAR RETHINASABAPATHI 1.
1 Content Distribution Networks. 2 Replication Issues Request distribution: how to transparently distribute requests for content among replication servers.
DNS and CDNs (Content Distribution Networks) Paul Francis Cornell Computer Science.
On the Use and Performance of Content Distribution Networks Balachander Krishnamurthy Craig Wills Yin Zhang Presenter: Wei Zhang CSE Department of Lehigh.
Content Distribution March 8, : Application Layer1.
Distributing Content Simplifies ISP Traffic Engineering Abhigyan Sharma* Arun Venkataramani* Ramesh Sitaraman*~ *University of Massachusetts Amherst ~Akamai.
Active Network Applications Tom Anderson University of Washington.
Achieving Load Balance and Effective Caching in Clustered Web Servers Richard B. Bunt Derek L. Eager Gregory M. Oster Carey L. Williamson Department of.
Server Load Balancing. Introduction Why is load balancing of servers needed? If there is only one web server responding to all the incoming HTTP requests.
 Zhichun Li  The Robust and Secure Systems group at NEC Research Labs  Northwestern University  Tsinghua University 2.
{ Content Distribution Networks ECE544 Dhananjay Makwana Principal Software Engineer, Semandex Networks 5/2/14ECE544.
Overcast: Reliable Multicasting with an Overlay Network CS294 Paul Burstein 9/15/2003.
Jonathan Walpole CSE515 - Distributed Computing Systems 1 Teaching Assistant for CSE515 Rahul Dubey.
World Wide Web Caching: Trends and Technologys Gerg Barish & Katia Obraczka USC Information Sciences Institute, USA,2000.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
Scalable Web Server on Heterogeneous Cluster CHEN Ge.
Web Hosting Herng-Yow Chen. Outline How different web site can be “ virtually hosted ” on the same server, and how this affects HTTP How to make web sites.
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.
OSDI 2002 Boston, MA 1 The Effectiveness of Request Redirection on CDN Robustness Limin Wang Vivek Pai and Larry Peterson Princeton University.
Multimedia & Mobile Communications Lab.
CS 347Notes101 CS 347 Parallel and Distributed Data Processing Distributed Information Retrieval Hector Garcia-Molina Zoltan Gyongyi.
Measuring the Capacity of a Web Server USENIX Sympo. on Internet Tech. and Sys. ‘ Koo-Min Ahn.
DotSlash – or how to deal with 15 minutes of fame Weibin Zhao Henning Schulzrinne Columbia University CATT/WICAT Annual Research Review November 14, 2003.
Information-Centric Networks Section # 5.3: Content Distribution Instructor: George Xylomenos Department: Informatics.
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
Information-Centric Networks Section # 5.1: Content Distribution Instructor: George Xylomenos Department: Informatics.
Content Delivery Networks: Status and Trends Speaker: Shao-Fen Chou Advisor: Dr. Ho-Ting Wu 5/8/
09/13/04 CDA 6506 Network Architecture and Client/Server Computing Peer-to-Peer Computing and Content Distribution Networks by Zornitza Genova Prodanoff.
Content Distribution Networks (CDNs)
/ Fast Web Content Delivery An Introduction to Related Techniques by Paper Survey B Li, Chien-chang R Sung, Chih-kuei.
John S. Otto Mario A. Sánchez John P. Rula Fabián E. Bustamante Northwestern, EECS.
Performance Evaluation of Redirection Schemes in Content Distribution Networks Jussi Kangasharju, Keith W. Ross Institut Eurecom Jim W. Roberts France.
Content Distribution Networks
Presentation on Distributed Web Based Systems Submitted by WWW
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
VIRTUAL SERVERS Presented By: Ravi Joshi IV Year (IT)
DotSlash: An Automated Web Hotspot Rescue System
Content Distribution Networks
Chapter 9 Applications (Naming) Outline Terminology
Content Distribution Networks + P2P File Sharing
Content Distribution Networks + P2P File Sharing
Presentation transcript:

Spring 2003CS 4611 Content Distribution Networks Outline Implementation Techniques Hashing Schemes Redirection Strategies

Spring 2003CS 4612 Design Space Caching –explicit –transparent (hijacking connections) Replication –server farms –geographically dispersed (CDN)

Spring 2003CS 4613 Story for CDNs Traditional: Performance –move content closer to the clients –avoid server bottlenecks New: DDoS Protection –dissipate attack over massive resources –multiplicatively raise level of resources needed to attack

Spring 2003CS 4614 Denial of Service Attacks (DoS) client attacker server

Spring 2003CS 4615 Distributed DoS (DDoS) server client attacker slave attacker zombie

Spring 2003CS 4616 Redirection Overlay clients R R R R R R R Internet Backbone Distributed request-redirectors Geographically distributed server clusters R

Spring 2003CS 4617 Techniques DNS –one name maps onto many addresses –works for both servers and reverse proxies HTTP –requires an extra round trip Router –one address, select a server (reverse proxy) –content-based routing (near client) URL Rewriting –embedded links

Spring 2003CS 4618 Redirection: Which Replica? Balance Load Cache Locality Network Delay

Spring 2003CS 4619 Hashing Schemes: Modulo Easy to compute Evenly distributed Good for fixed number of servers Many mapping changes after a single server change % URL (key) svr0 svrN

Spring 2003CS Consistent Hashing (CHash) Hash server, then URL Closest match Only local mapping changes after adding or removing servers Used by State-of-the-art CDNs Unit circle svr0 svr1 svr2 svrN url-0 url-1

Spring 2003CS Highest Random Weight (HRW) Hash(url, svrAddr) Deterministic order of access set of servers Different order for different URLs Load evenly distributed after server changes RH URL svr0 svr1 svr2 svr svrN sort weight0 weight1 weight2 weight0 weight N high low

Spring 2003CS Redirection Strategies Random (Rand) –Requests randomly sent to cooperating servers –Baseline case, no pathological behavior Replicated Consistent Hashing (R-CHash) –Each URL hashed to a fixed # of server replicas –For each request, randomly select one replica Replicated Highest Random Weight (R-HRW) –Similar to R-CHash, but use HRW hashing –Less likely two URLs have same set of replicas

Spring 2003CS Redirection Strategies (cont) Coarse Dynamic Replication (CDR) –Using HRW hashing to generate ordered server list –Walk through server list to find a lightly loaded one –# of replicas for each URL dynamically adjusted –Coarse grained server load information Fine Dynamic Replication (FDR) –Bookkeeping min # of replicas of URL (popularity) –Let more popular URL use more replicas –Keep less popular URL from extra replication

Spring 2003CS Simulation Identifying bottlenecks –Server overload, network congestion… End-to-end network simulator prototype –Models network, application, and OS –Built on NS + LARD simulators –100s of servers, 1000s of clients –>60,000 req/s using full-TCP transport –Measure capacity, latency, and scalability

Spring 2003CS Network Topology PA CA WA SD CA TX NE CO GA MA MI IL R SS DC R S R S R RR S S S R R R RR R R R R R R S S CC C C CC C C CC C C C S – Server, C – Client, R - Router

Spring 2003CS Simulation Setup Workload –Static documents from Web Server trace, available at each cooperative server –Attackers from random places, repeat requesting a subset of random files Simulation process –Gradually increase offered request load –End when servers very heavily overloaded

Spring 2003CS Capacity: 64 server case Normal Operation A single server can handle ~600 req/s in simulation

Spring 2003CS Capacity: 64 server case Under Attack (250 zombies, 10 files, avg 6KB) A single server can handle ~600 req/s in simulation

Spring 2003CS Latency: 64 Servers Under Attack Random’s Max: 11.2k req/sR-CHash Max: 19.8k req/s

Spring 2003CS Latency At CDR’s Max: 35.1k req/s

Spring 2003CS Capacity Scalability Under Attack (250 zombies, 10 files)Normal Operation

Spring 2003CS Various Attacks (32 servers) 1 victim file, 1 KB10 victim files, avg 6KB

Spring 2003CS Deployment Issues Servers join DDoS protection overlay –Same story as Akamai –Get protection and performance Clients use DDoS protection service –Same story as proxy caching –Incrementally deployable –Get faster response and help others