Content Delivery Networks. Shaxun Chen April 21, 2009

Similar documents
Distributed Systems. 23. Content Delivery Networks (CDN) Paul Krzyzanowski. Rutgers University. Fall 2015

Content Delivery Networks (CDN) Dr. Yingwu Zhu

Distributed Systems. 25. Content Delivery Networks (CDN) 2014 Paul Krzyzanowski. Rutgers University. Fall 2014

Content Delivery Networks

Internet Content Distribution

How To Understand The Power Of A Content Delivery Network (Cdn)

Distributed Systems. 24. Content Delivery Networks (CDN) 2013 Paul Krzyzanowski. Rutgers University. Fall 2013

Web Caching and CDNs. Aditya Akella

Distributed Systems 19. Content Delivery Networks (CDN) Paul Krzyzanowski

Measuring the Web: Part I - - Content Delivery Networks. Prof. Anja Feldmann, Ph.D. Dr. Ramin Khalili Georgios Smaragdakis, PhD

From Internet Data Centers to Data Centers in the Cloud

FortiBalancer: Global Server Load Balancing WHITE PAPER

Request Routing, Load-Balancing and Fault- Tolerance Solution - MediaDNS

Demand Routing in Network Layer for Load Balancing in Content Delivery Networks

1. Comments on reviews a. Need to avoid just summarizing web page asks you for:

CDN and Traffic-structure

CSC2231: Akamai. Stefan Saroiu Department of Computer Science University of Toronto

Content Delivery Networks

Global Server Load Balancing

The Effectiveness of Request Redirection on CDN Robustness

Web Application Hosting Cloud Architecture

Lecture 3: Scaling by Load Balancing 1. Comments on reviews i. 2. Topic 1: Scalability a. QUESTION: What are problems? i. These papers look at

DATA COMMUNICATOIN NETWORKING

Efficient Parallel Distributed Load Balancing in Content Delivery Networks

Global Server Load Balancing

Load Balancing in Distributed Web Server Systems With Partial Document Replication

How To Model The Content Delivery Network (Cdn) From A Content Bridge To A Cloud (Cloud)

Testing & Assuring Mobile End User Experience Before Production. Neotys

Measuring CDN Performance. Hooman Beheshti, VP Technology

Web DNS Peer-to-peer systems (file sharing, CDNs, cycle sharing)

Basheer Al-Duwairi Jordan University of Science & Technology

Dynamic Load Balancing and Node Migration in a Continuous Media Network

Indirection. science can be solved by adding another level of indirection" -- Butler Lampson. "Every problem in computer

Peer-to-Peer Networks. Chapter 6: P2P Content Distribution

Content Distribu-on Networks (CDNs)

Overlay Networks. Slides adopted from Prof. Böszörményi, Distributed Systems, Summer 2004.

Giving life to today s media distribution services

How To Understand The Power Of Icdn

Study of Flexible Contents Delivery System. With Dynamic Server Deployment

The Value of Content Distribution Networks Mike Axelrod, Google Google Public

Real-Time Analysis of CDN in an Academic Institute: A Simulation Study

CHAPTER 4 PERFORMANCE ANALYSIS OF CDN IN ACADEMICS

WAVE: Popularity-based and Collaborative In-network Caching for Content-Oriented Networks

Intelligent Content Delivery Network (CDN) The New Generation of High-Quality Network

The Feasibility of Supporting Large-Scale Live Streaming Applications with Dynamic Application End-Points

COMP 631: COMPUTER NETWORKS. How to distribute content without requiring centralized, heavy-duty servers? Peer-to-peer content distribution

DNS, CDNs Weds March Lecture 13. What is the relationship between a domain name (e.g., youtube.com) and an IP address?

International Journal of Scientific & Engineering Research, Volume 4, Issue 11, November ISSN

Internet Content Distribution

Experimentation with the YouTube Content Delivery Network (CDN)

The Effect of Caches for Mobile Broadband Internet Access

Analysing the impact of CDN based service delivery on traffic engineering

An Efficient Load Balancing Technology in CDN

The old Internet. Software in the Network: Outline. Traditional Design. 1) Basic Caching. The Arrival of Software (in the network)

Question: 3 When using Application Intelligence, Server Time may be defined as.

Simulation and Analysis of Content Delivery Network

Data Center Content Delivery Network

Advanced Networking Technologies

LARGE SCALE INTERNET SERVICES

Overview. Tor Circuit Setup (1) Tor Anonymity Network

Scalable Internet Services and Load Balancing

Content Delivery Network. Version 0.95

A Walk through Content Delivery Networks

Data Caching in Networks with Reading, Writing and Storage Costs

AN EFFICIENT LOAD BALANCING ALGORITHM FOR A DISTRIBUTED COMPUTER SYSTEM. Dr. T.Ravichandran, B.E (ECE), M.E(CSE), Ph.D., MISTE.,

High volume Internet data centers. MPLS-based Request Routing. Current dispatcher technology. MPLS-based architecture

HPAM: Hybrid Protocol for Application Level Multicast. Yeo Chai Kiat

ProxyTeller: A Proxy Placement Tool for Content Delivery under Performance Constraints

A Survey on Rendezvous Data Collection in Wireless Sensor Networks. Presented by Longfei Shangguan Supervisor:Dr.Yunhao Liu

LOAD BALANCING MECHANISMS IN DATA CENTER NETWORKS

Computer Networks - CS132/EECS148 - Spring

Single Pass Load Balancing with Session Persistence in IPv6 Network. C. J. (Charlie) Liu Network Operations Charter Communications

networks Live & On-Demand Video Delivery without Interruption Wireless optimization the unsolved mystery WHITE PAPER

Chapter 2. Literature Review

Multi-layer switch hardware commutation across various layers. Mario Baldi. Politecnico di Torino.

Net Optics Learning Center Presents The Fundamentals of Passive Monitoring Access

John S. Otto Fabián E. Bustamante

Deliuery Networks. A Practical Guide to Content. Gilbert Held. Second Edition. CRC Press. Taylor & Francis Group

OpenFlow Based Load Balancing

Cisco Videoscape Distribution Suite Service Broker

A Topology-Aware Relay Lookup Scheme for P2P VoIP System

Test Run Analysis Interpretation (AI) Made Easy with OpenLoad

Transcription:

Content Delivery Networks Shaxun Chen April 21, 2009

Outline Introduction to CDN An Industry Example: Akamai A Research Example: CDN over Mobile Networks Conclusion

Outline Introduction to CDN An Industry Example: Akamai A Research Example: CDN over Mobile Networks Conclusion

What is Content Delivery Network A content delivery network (CDN): -- a system of computers (computing devices) networked together (across the Internet) that cooperate to deliver content to end users, in order to improve performance, scalability, and cost efficiency. Distributed system Transparent to end users

Motivation Request load overwhelms the web sites! Web server processing ability Bandwidth Back-end transaction-processing infrastructure 1.5 billion visits per day 0.2 billion videos viewed every day 5.4 billion visits per day If, customers will complain: Speed Availability

Approaches to Delivering Content Single Server Mirrors CDN

Approaches to Delivering Content Single Server Mirrors CDN

Approaches to Delivering Content Single Server Mirrors CDN

Concepts or Terms Servers Origin server Surrogate servers / Edge servers Roles CDN providers: Akamai, Digital Island CDN customers: Yahoo, AOL, CNN Clients / end users

Advantages of CDN Reduce (backbone) bandwidth costs Improve end user performance Shorter latency / response quickly Less delay jitter Higher bandwidth Increase global availability of content

CDN vs. Web Proxies First: Web proxies store most frequently or most recently requested content; work in a passive way What CDNs store is decide by CDN administrators Second: Web proxies only handle static web pages Dynamic content / secured content / streaming content (CDN handles them using ESI) Third: Proxies work on a local basis CDNs provide more availability

Best Surrogate Server From end-users (clients) point of view, which surrogate server is the best? Nearest (physical distance) Speed (bandwidth) Delay (round-trip time), delay jitter Reliability (packet loss rate) Data transmission cost Server load Combinations of the above

Placement of Surrogate Servers [1] We have N possible locations at edge of the Internet, and are able to afford K (K<N) surrogate servers, how to place them to minimize the total cost? Cost: metrics Refers to choose best surrogate server Formalization: (Minimum K-Median Problem) Given N points, we must select K of these to be centers (surrogate servers), and then assign each input point j to the selected center that is closest to it. If location j is assigned to a center i, we incur a cost d j C ij. The goal is to select K centers so as to minimize the sum of the assignment costs. NP-hard [1] L. Qiu, et al., On the Placement of Web Server Replicas. Infocom 2001, Alaska, US.

Tree-based Algorithm [2] Two assumptions The network structure is a tree; the origin server is the root of the tree Clients request from the closest surrogate server on their path toward the root Based on these two assumptions, we are able to get a optimum placement within O(N 3 K 2 ) [2] B. Li, et al., On the Optimal Placement of Web Proxies in the Internet. Infocom 1999, New York, US.

Greedy Algorithm Chooses the first center (with minimum cost) among N places; chooses next center among rest of N-1 places Time complexity: O(N 2 K)

Greedy Algorithm Chooses the first center (with minimum cost) among N places; chooses next center among rest of N-1 places Time complexity: O(N 2 K)

Greedy Algorithm Chooses the first center (with minimum cost) among N places; chooses next center among rest of N-1 places Time complexity: O(N 2 K)

Hot Spot Algorithm Places surrogate servers near the clients generating the greatest load. Sorts the N potential sites according to the amount of traffic generated within their vicinity, and places the surrogate server at the top K sites. A s vicinity is the circle centered at A with some radius. We change the radius, repeat the algorithm and choose the best one as output Time complexity: N 2 + NlogN + NK O(N 2 )

Hot Spot Algorithm Places surrogate servers near the clients generating the greatest load. Sorts the N potential sites according to the amount of traffic generated within their vicinity, and places the surrogate server at the top K sites. A s vicinity is the circle centered at A with some radius. We change the radius, repeat the algorithm and choose the best one as output Time complexity: N 2 + NlogN + NK O(N 2 )

Hot Spot Algorithm Places surrogate servers near the clients generating the greatest load. Sorts the N potential sites according to the amount of traffic generated within their vicinity, and places the surrogate server at the top K sites. A s vicinity is the circle centered at A with some radius. We change the radius, repeat the algorithm and choose the best one as output Time complexity: N 2 + NlogN + NK O(N 2 )

Random Algorithm Chooses K sites from N places randomly; performs 10 times, and get the best result. Time complexity: O(NK)

Evaluation Results In a tree-structure network, greedy tree-based > hot spot > random The paper says greedy is slightly better, why? In an arbitrary network, greedy > hotpot > tree > random

Server Placement in Real World Assumptions hold true? Tree Each client uses a single replica (surrogate server) Policy issues

How to Redirect URL rewriting Origin server redirects clients to different surrogate servers by rewriting the page s URL links Dynamic Static Bottleneck Domain Name System (DNS) redirection DNS server direct requests to CDN

Select a CDN From a customer s point of view, which CDN to choose? Cache hit ratio Saved bandwidth Surrogate server utilization Reliability

Outline Introduction to CDN An Industry Example: Akamai A Research Example: CDN over Mobile Networks Conclusion

Overview of Akamai Launched in 1999 Over 12,000 servers in 62 countries Serves Yahoo!, Apple, AOL How Akamai works Domain Name System (DNS) redirection

Normal DNS Working Process

How DNS Redirection Works

How DNS Redirection Works (cont.) What Akamai does Manage customers DNS server Pretend to be a normal DNS server But more complex inside Probing Selecting Load balancing Example: visit Yahoo via Akamai

Selecting Criteria Server must be able to satisfy the request e.g. can handle streaming media? Has the content? Server health Server load Network condition Packet loss rate Bandwidth Client location

Different Types of Content Static content Lifetimes Special features Dynamic content ESI: break a dynamic page into fragments Assemble dynamic pages at surrogate servers Streaming media Deliver packets without significant delay or jitter Content unreachable Split the TCP connection into two separate connections

Outline Introduction to CDN An Industry Example: Akamai A Research Example: CDN over Mobile Networks Conclusion

A Research Example: CDN over MANET [3] In a more general sense, CDN refers to any overlay network built for the purpose of facilitating content delivery Background: Pervasive computing / ubiquitous computing Goal: make computers work in a more intelligent way Decrease users intended input Representative applications, Examples [3] S. Chen, et al., Application based Distance Measurement for Context Retrieval in Ubiquitous Computing. MobiQuitous 2007, Philadelphia, US.

Hardware Environment Sensors, computers, smart phones and PDAs Both fixed and mobile nodes Each node may serve as data producer and data consumer We want to improve the data retrieval performance, however, it s impossible to store replicas on every node Limited storage Limited energy Communication costs

Context Clustering Different types of data (contexts) Light / sound / temperature / humidity / user s schedule / location Logical distance between contexts Which contexts are often used (queried) by applications simultaneously? = = = = q j j q j j q j j j t s t s T S 1 2 1 2 1 ), cos( ), ( cos 1 ), sin( ), ( 2 T S T S T S D = =

Replica Placement If the logical distance between two types of contexts is lower than a threshold, they cache each other, or shortcuts are built between them

Outline Introduction to CDN An Industry Example: Akamai A Research Example: CDN over Mobile Networks Conclusion

Conclusion CDN is a overlay network which aims at efficiently delivering content. Open issues CDN on P2P networks / mobile networks Authentication/ security issues

Thank you