Tradeoffs in CDN Designs for Throughput Oriented Traffic Minlan Yu University of Southern California 1 Joint work with Wenjie Jiang, Haoyuan Li, and Ion.

Slides:



Advertisements
Similar presentations
Network Aware Forward Caching Presenter: Alexandre Gerber Jeffrey Erman, Mohammad T. Hajiaghayi, Dan Pei, Oliver Spatscheck AT&T Labs Research April 24.
Advertisements

Performance in Decentralized Filesharing Networks Theodore Hong Freenet Project.
CONFIDENTIAL © 2004 Procket Networks, Inc. All rights reserved. 4-Feb-14 The 21 st Century Intelligent Network Tony Li, Carl DeSousa.
P2P Market Conference March 2009 Mitchell Edwards CFO & GC BitTorrent, Inc.
1 Jin Li Microsoft Research. Outline The Upcoming Video Tidal Wave Internet Infrastructure: Data Center/CDN/P2P P2P in Microsoft Locality aware P2P Conclusions.
The strength of routing Schemes. Main issues Eliminating the buzz: Are there real differences between forwarding schemes: OSPF vs. MPLS? Can we quantify.
Ningning HuCarnegie Mellon University1 Optimizing Network Performance In Replicated Hosting Peter Steenkiste (CMU) with Ningning Hu (CMU), Oliver Spatscheck.
1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.
Akamai networks,48000 servers and 70 countries in the world.
On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs – Research) Scott.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Suphakit Awiphan, Takeshi Muto, Yu Wang, Zhou Su, Jiro Katto
Resource Pooling A system exhibits complete resource pooling if it behaves as if there was a single pooled resource. The Internet has many mechanisms for.
Packet Caches on Routers: The Implications of Universal Redundant Traffic Elimination Ashok Anand, Archit Gupta, Aditya Akella University of Wisconsin,
Identifying Performance Bottlenecks in CDNs through TCP-Level Monitoring Peng Sun Minlan Yu, Michael J. Freedman, Jennifer Rexford Princeton University.
Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada ISP-Friendly Peer Matching without ISP Collaboration Mohamed Hefeeda (Joint.
IPlane: An Information Plane for Distributed Services Offence by: Anup Goyal Sagar Vemuri.
Traffic Engineering With Traditional IP Routing Protocols
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 Traffic Engineering for ISP Networks Jennifer Rexford IP Network Management and Performance AT&T Labs - Research; Florham Park, NJ
Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu.
1 Drafting Behind Akamai (Travelocity-Based Detouring) AoJan Su, David R. Choffnes, Aleksandar Kuzmanovic, and Fabian E. Bustamante Department of Electrical.
P4P: Proactive Provider Assistance for P2P Haiyong Xie (Yale) *This is a joint work with Arvind Krishnamurthy (UWashington) and Richard.
Web Caching and CDNs March 3, Content Distribution Motivation –Network path from server to client is slow/congested –Web server is overloaded Web.
Content Delivery Networks. History Early 1990s sees 100% growth in internet traffic per year 1994 o Netscape forms and releases their first browser.
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
Datacenter Wide-areaEnterprise LOAD-BALANCER Client Servers.
Datacenter Wide-areaEnterprise LOAD-BALANCER Client Servers.
Can Internet Video-on-Demand Be Profitable? SIGCOMM 2007 Cheng Huang (Microsoft Research), Jin Li (Microsoft Research), Keith W. Ross (Polytechnic University)
© 2009 AT&T Intellectual Property. All rights reserved. Multimedia content growth: From IP networks to Medianets Cisco-IEEE ComSoc Webinar. Sept. 23, 2009.
P2P Games Conference “Attributes of the Gaming Cloud?” Norman Henderson ASANKYA
Content Distribution March 8, : Application Layer1.
Distributing Content Simplifies ISP Traffic Engineering Abhigyan Sharma* Arun Venkataramani* Ramesh Sitaraman*~ *University of Massachusetts Amherst ~Akamai.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
Approximate Load Balance Based on ID/Locator Split Routing Architecture 1 Sanqi Zhou, Jia Chen, Hongbin Luo, Hongke Zhang Beijing JiaoTong University
Impact of Prefix Hijacking on Payments of Providers Pradeep Bangera and Sergey Gorinsky Institute IMDEA Networks, Madrid, Spain Developing the Science.
07/21/2005 Senmetrics1 Xin Liu Computer Science Department University of California, Davis Joint work with P. Mohapatra On the Deployment of Wireless Sensor.
Capacity Scaling with Multiple Radios and Multiple Channels in Wireless Mesh Networks Oguz GOKER.
Network Aware Resource Allocation in Distributed Clouds.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
Putting Intelligence in Internetworking: an Architecture of Two Level Overlay EE228 Project Anshi Liang Ye Zhou.
Aditya Akella The Performance Benefits of Multihoming Aditya Akella CMU With Bruce Maggs, Srini Seshan, Anees Shaikh and Ramesh Sitaraman.
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 Multi-Class Traffic Management in Data Center Backbone Networks Amitabha Ghosh (UtopiaCompression) Sangtae Ha (Princeton) Edward Crabbe (Google)
Towards a More Fair and Robust Internet Backbone Year 1 Status Report Rene Cruz, Tara Javidi, Bill Lin Center for Networked Systems University of California,
Some questions about multipath Damon Wischik, UCL Trilogy UCL.
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
ASSIGNMENT, DISTRIBUTION AND QOS PROVISIONING IN COMMUNICATION NETWORKS.
Resource Allocation in Network Virtualization Jie Wu Computer and Information Sciences Temple University.
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
Scaling Properties of the Internet Graph Aditya Akella, CMU With Shuchi Chawla, Arvind Kannan and Srinivasan Seshan PODC 2003.
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
Content Delivery Networks: Status and Trends Speaker: Shao-Fen Chou Advisor: Dr. Ho-Ting Wu 5/8/
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.
Scaling Properties of the Internet Graph Aditya Akella With Shuchi Chawla, Arvind Kannan and Srinivasan Seshan PODC 2003.
Datacenter Wide-areaEnterprise LOAD-BALANCER Client Servers.
Yiting Xia, T. S. Eugene Ng Rice University
Data Center Network Architectures
Content Distribution Networks
ECE 544: Traffic engineering (supplement)
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
An Equal-Opportunity-Loss MPLS-Based Network Design Model
ISP and Egress Path Selection for Multihomed Networks
VDN: Virtual Machine Image Distribution Network for Cloud Data Centers
Internet and Web Simple client-server model
Challenges with developing a Commercial P2P System
EE 122: Lecture 22 (Overlay Networks)
Presentation transcript:

Tradeoffs in CDN Designs for Throughput Oriented Traffic Minlan Yu University of Southern California 1 Joint work with Wenjie Jiang, Haoyuan Li, and Ion Stoica

Throughput-Oriented Traffic 2 Throughput-oriented traffic is growing in Internet – Cisco report predicts that 90% of the consumer traffic will be video by 2013 (E.g., NetFlix, Youtube) – Software, game, movie downloads – Most are delivered by content distribution networks Revisit CDN design choices for throughput- oriented traffic

Where is the throughput bottleneck? 3 Client: Computer/access link too slow Network: Congestions at peering and upstream links Server: Not enough resource (CPU, power, bw)

Understanding Throughput Bottleneck Network bottlenecks are common – NetFlix sees reduced video rates due to low ISP capacity – Akamai reported bottlenecks at peering links 4 Degraded video performance caused by network congestion

Nature of Bottleneck is Changing More throughput-oriented applications – Video traffic lasts longer and has higher volume More elephants step on each other in the future – Decreases the benefits of statistical multiplexing – Introduces more challenges in bandwidth provisioning 5

Improving Network Throughput ISP-CDNs: multiple paths and better path selections – ISPs move up in the revenue chain to deliver content ISP-CDNs such as AT&T and Verizon – Control both servers and the network – Better traffic engineering for CDN traffic Existing CDNs: Deploy servers at more locations and setting up more peering points 6 … Peering points Question 1: What’s the throughput benefit of more paths over more peering points?

Improving CDN Throughput Highly distributed approach (e.g., Akamai) – Many server locations, more high-throughput paths – Higher management, replication, bandwidth cost More centralized approach (e.g., Limelight) – A few large data centers with more peering points – Lower cost due to economy of scale 7 … More centralizedHighly distributed Question 2: How to compare more centralized vs. more distributed CDNs on throughput and cost?

Modeling CDN Design Choices CDNs: Increase peering points at the edge ISPs: Improve path selection at the core 8

Increase Peering Points Modeling peering points (PPs) – Increase #PPs to study throughput effect – Pick PP locations from synthetic and real topologies Peering point selection – Maximize aggregate throughput – By assigning client locations to PPs … and splitting traffic to different PPs 9

Improve Path Selection Today: No cooperation (1path) – ISPs: Shortest path routing (e.g., OSPF) – CDNs: Select peering points to maximize throughput Better contracts between ISPs and CDNs (n paths) – ISPs: Expose multiple shortest paths to CDNs (e.g.,MPLS) – CDNs: Select peering points and paths 10

Improving Path Selection ISP-CDNs: Optimal throughput (mcf) – Joint traffic engineering and server selection – Reduced to multi-commodity flow problem Optimization formulation – Objectives: Max total throughput – Subject to: Client demands & Link capacity constraints – Variables: Peering point selection, traffic splitting on each paths (Flow_{path, pp, client}) 11

An Example 12 Capacity =2 Capacity =1 With PP2 and PP3, the maximum throughput of multiple paths is 4 (min-cut size 4) Increase to 4 PPs, the min-cut size now is 8 With PP2 and PP3, the maximum throughput of multiple paths is 4 (min-cut size 4) Increase to 4 PPs, the min-cut size now is 8 Min-cut size – improving path selection only approximates the min-cut size – increasing #peering points essentially increases min-cut size

Question 1: What’s the benefit of path selection over peering point selection? 13

Quantify the Benefits under Various Scenarios Network – Topologies: power-law, random, hierarchy, different link density, router-level ISP topo, AS-level Internet topo – Link capacity distribution: uniform, exp., pareto, higher inter-AS bandwidth CDN peering points – Map Akamai and Limelight server IP addresses to ASes (collected from PlanetLab measurement at Nov. 2010) – Randomly pick peering points for synthetic topologies Client demands – Session-level traces from Conviva collected between Dec and April

Multipath is better than Multiple Locations – Power law graph (500 nodes, 997 links) – Uniform link capacity distribution – 200 clients at random locations 15 Multiple paths have little improvement over increasing peering points Multiple paths have little improvement over increasing peering points

Effect of Network Topology – Increasing peering points are better than multipath in most topologies – Except star-like topology with uniform link capacity 16 The throughput from 1path to mcf increases by 110% - 584% The throughput from 10 PPs to 20 PPs increases by 337%

Path selection not useful under Flash Crowd 17 – Conviva traces during normal and flash crowd periods – Path selection has little benefits under normal traffic – Path selection is worse than only peering point selection Thpt (Path + peering point selection) Thpt (Peering point selection)

More peering points always better than more paths with long-tail Distribution of Contents 18 – Long-tail content distribution trace from Conviva – With fewer replications, the throughput benefit of multipath increases Without replication the content delivery is closer to the single- source traffic

Takeaway 1: CDNs only need to control the edge of the Internet to improve the throughput. ISP-CDNs don’t get significant benefits from controlling the network over CDNs 19

Question 2: How to compare throughput and cost between more centralized vs more dist. CDNs? 20

Throughput Comparison of CDNs 21 – Assume a fixed aggregate peering bandwidth per CDN – A more distributed CDN achieves better throughput than more centralized one Distributed Centralized

CDN Operation Cost Management cost – At each location: electricity, cooling, equip maintenance, and human resources Content replication cost – Storage cost to replicate popular content – Bandwidth cost to redirect traffic for rare content Bandwidth cost – CDNs often pay ISPs for the bandwidth they use at the peering points based on mutually-agreed billing model 22

Different Cost Functions 23 Cost as a function of bandwidth at a location – Different functions: polynomial, linear, log, exp – Model how fast the unit cost drops with throughput – In practice: a linear combination of different functions

Polynomial Cost 24 Distributed Centralized Dist. CDN is more expensive than Centralized one – Limelight has larger throughput at each location and thus better scalability gains – Same observation holds across various operational cost functions and their combinations

Takeaway 2: More distributed CDNs achieve higher throughput than more centralized CDNs, but… … are more expensive for same throughput 25

Conclusion A simple model to quantify CDN design choices – Increasing the number of peering points – Improving path selection – More distributed vs more centralized design Optimizations at the edge is enough for CDNs – Multipath has little benefit over increasing # locations and choosing different peering links – There’s a tradeoff of throughput and cost among CDNs 26

Thanks! Questions? 27