Distributing Content Simplifies ISP Traffic Engineering Abhigyan Sharma* Arun Venkataramani* Ramesh Sitaraman*~ *University of Massachusetts Amherst ~Akamai.

Slides:



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

Abhigyan, Aditya Mishra, Vikas Kumar, Arun Venkataramani University of Massachusetts Amherst 1.
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.
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
1 Efficient and Robust Streaming Provisioning in VPNs Z. Morley Mao David Johnson Oliver Spatscheck Kobus van der Merwe Jia Wang.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
19 Historical overview Main challenge: How to distribute content in high quality over the Internet cost-effectively? • Traditional “Best-effort” model:
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.
Spring 2003CS 4611 Content Distribution Networks Outline Implementation Techniques Hashing Schemes Redirection Strategies.
Traffic Engineering With Traditional IP Routing Protocols
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
An Analysis of Internet Content Delivery Systems Stefan Saroiu, Krishna P. Gommadi, Richard J. Dunn, Steven D. Gribble, and Henry M. Levy Proceedings of.
Shadow Configurations: A Network Management Primitive Richard Alimi, Ye Wang, Y. Richard Yang Laboratory of Networked Systems Yale University.
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
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
Traffic Engineering in IP Networks Jennifer Rexford Computer Science Department Princeton University; Princeton, NJ
1 Drafting Behind Akamai (Travelocity-Based Detouring) AoJan Su, David R. Choffnes, Aleksandar Kuzmanovic, and Fabian E. Bustamante Department of Electrical.
Squirrel: A decentralized peer- to-peer web cache Paul Burstein 10/27/2003.
Web Caching and CDNs March 3, Content Distribution Motivation –Network path from server to client is slow/congested –Web server is overloaded Web.
Tradeoffs in CDN Designs for Throughput Oriented Traffic Minlan Yu University of Southern California 1 Joint work with Wenjie Jiang, Haoyuan Li, and Ion.
ISP vs. ISP+CDN: Can ISPs in Duopoly Profit by Introducing CDN Services? Dongmyung Lee Seoul National University June 11, 2012 Joint work with J. Mo and.
Datacenter Wide-areaEnterprise LOAD-BALANCER Client Servers.
Datacenter Wide-areaEnterprise LOAD-BALANCER Client Servers.
1 Latency Equalization: A Programmable Routing Service Primitive Minlan Yu Joint work with Marina Thottan, Li Li at Bell Labs.
Web Caching and Content Delivery. Caching for a Better Web Performance is a major concern in the Web Proxy caching is the most widely used method to improve.
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
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.
1 Caching  Temporary storage of frequently accessed data (duplicating original data stored somewhere else)  Reduces access time/latency for clients 
Content Distribution March 8, : Application Layer1.
{ Content Distribution Networks ECE544 Dhananjay Makwana Principal Software Engineer, Semandex Networks 5/2/14ECE544.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
Lecture 15. IGP and MPLS D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
Overcast: Reliable Multicasting with an Overlay Network CS294 Paul Burstein 9/15/2003.
P4P: Provider Portal for Applications Haiyong Xie, Y. Richard Yang Arvind Krishnamurthy, Yanbin Liu, Avi Silberschatz SIGCOMM ’08 Hoon-gyu Choi
CPSC 441: Multimedia Networking1 Outline r Scalable Streaming Techniques r Content Distribution Networks.
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.
1 Min-Cost Live Webcast under Joint Pricing of Data, Congestion and Virtualized Servers Rui Zhu 1, Di Niu1, Baochun Li 2 1 Department of Electrical and.
A novel approach of gateway selection and placement in cellular Wi-Fi system Presented By Rajesh Prasad.
Web Caching and Content Distribution: A View From the Interior Syam Gadde Jeff Chase Duke University Michael Rabinovich AT&T Labs - Research.
CDN: Content Distribution Networks  References:  CS613 textbook, “Computer Networking – A Top-Down Approach”, 6 th edition. Chapter  The text.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
Kiew-Hong Chua a.k.a Francis Computer Network Presentation 12/5/00.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.
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.
On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs – Research) Scott.
KAIS T On the problem of placing Mobility Anchor Points in Wireless Mesh Networks Lei Wu & Bjorn Lanfeldt, Wireless Mesh Community Networks Workshop, 2006.
ASSIGNMENT, DISTRIBUTION AND QOS PROVISIONING IN COMMUNICATION NETWORKS.
March 2001 CBCB The Holy Grail: Media on Demand over Multicast Doron Rajwan CTO Bandwiz.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
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.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Performance Evaluation of Redirection Schemes in Content Distribution Networks Jussi Kangasharju, Keith W. Ross Institut Eurecom Jim W. Roberts France.
Multicast in Information-Centric Networking March 2012.
Datacenter Wide-areaEnterprise LOAD-BALANCER Client Servers.
P4P : Provider Portal for (P2P) Applications Haiyong Xie, Y
Notes Onur Ascigil, Vasilis Sourlas, Ioannis Psaras, and George Pavlou
Network CDNs Abhigyan Sharma Hello, I am Abhigyan from Umass Amherst.
ECE 671 – Lecture 16 Content Distribution Networks
Edge computing (1) Content Distribution Networks
It Followed Me Home: Exploring Strong Last Hop Devices and CDNs
Backbone Traffic Engineering
EE 122: Lecture 22 (Overlay Networks)
Presentation transcript:

Distributing Content Simplifies ISP Traffic Engineering Abhigyan Sharma* Arun Venkataramani* Ramesh Sitaraman*~ *University of Massachusetts Amherst ~Akamai Technologies 1

Tripartite view of content delivery CDN Networks Content providers N C D N N C D N NCDNs deployed in 30+ ISPs globally N C D N

NCDN Management Traffic Engineering Content Distribution NCDN Mgmt. 3 Optimize routing to remove congestion hotspots Optimize content placement & request redirection to improve user-perceived performance

NCDN Routing Placement Interaction B C A D 8 Mbps 4 Mbps 0.5 Mbps 1.5 Mbps Demand = 1 Mbps Demand = 0.5 Mbps Maximum link utilization (MLU) = 0.75/1.5 = Mbps 0.25 Mbps 0.75 Mbps Traffic labeled with flow value Link labeled with capacity

NCDN Routing Placement Interaction B C A D 8 Mbps 4 Mbps 0.5 Mbps 1.5 Mbps Demand = 1 Mbps Demand = 0.5 Mbps Maximum link utilization (MLU) = 1/8 = Traffic labeled with flow value Link labeled with capacity 0.5 Mbps 1 Mbps Content placement flexibility reduces network costs and enables simpler routing

NCDN Schemes Classification Unplanned (e.g. LRU Caching) Unplanned (e.g. LRU Caching) Traffic Engineering Traffic Engineering Content Distribution Joint Optimization Planned (history- based) Planned (history- based) Planned (e.g. OSPF weight tuning) Planned (e.g. OSPF weight tuning) Unplanned (static routing) 6 NCDN Management

Research Questions How do simple unplanned schemes perform? Is joint optimization better than other schemes? What matters more: placement or routing? 7

Outline Network CDN NCDN Model & Joint Optimization Datasets: Akamai Traces & ISP Topologies Results Related Work 8

NCDN Model Downstream end-users 9 Origin servers NCDN POP Content servers Backbone router at exit nodes Backbone router

NCDN Model Downstream end-users 10 Origin servers NCDN POP Content servers Backbone router at exit nodes Backbone router

NCDN Model Downstream end-users 11 Origin servers NCDN POP Content servers Backbone router at exit nodes Backbone router

NCDN Model Downstream end-users 12 Origin servers ISP backbone link capacity Resource constraints POP storage

NCDN Joint Optimization Hardness Theorem 1: Opt-NCDN is NP-Complete even in the special case where all objects have unit size, all demands, link capacities and storage capacities have binary values. Approximability Theorem 2: Opt-NCDN is inapproximable within a factor β for any β > 1 unless P = NP. 13

MIP for Joint Optimization 14 Objective: Minimize NCDN-cost (MLU or latency) Constraints: For all node: total size of content < Storage capacity For all (content, node): demand must be served from POPs or origin Output variables: Placement: Binary variable i XY indicates whether content X is stored at node Y Redirection Routing

Outline Network CDN NCDN Model & Joint Optimization Datasets: Akamai Traces & ISP Topologies Results Related Work 15

Datasets 16 Akamai traces Traffic typesOn-demand video & download How measured?Instrument client software, e.g., media player plugin DataContent URL, content provider, lat-long, timestamp, bytes downloaded, file size Volume7.79 m users, 28.2 m requests, 1455 TB data ISP topologies NetworksTier-1 US ISP & Abilene DataPOP lat-long, link capacities Mapping: Akamai trace  ISP topology Map request to geographically closest ISP POP

Outline Network CDN NCDN Model & Joint Optimization Datasets: Akamai Traces & ISP Topologies Results – Schemes Evaluated – Network Cost – Latency Cost – Network Cost: Planned vs. Unplanned Routing Related Work 17

Schemes Evaluated SchemeRouting + placement + redirection UNPLANNED OSPF with link-weight = 1/link-capacity + LRU caching + redirect to closest hop count node JOINT- OPTIMIZATION Realistic joint optimization Once per day with yesterday’s content demand ORACLE Ideal joint optimization Once per day with current day’s content demand 18

Network Cost 19 3x 18%

Latency Cost 20 Latency Cost = E2E propagation delay + Link utilization dependent delay 28% Content placement matters tremendously in NCDNs

Network Cost: Planned vs. Unplanned Routing 21 10% or less Unplanned placement, unplanned routing vs. Unplanned placement, planned routing Traditional TE gives small cost reduction in NCDNs

Related Work 22 ISP-CDN joint optimization of routing & redirection (with fixed placement) [Xie ‘08, Jiang ‘09, Frank ’12] Optimize placement (with fixed routing) for VoD content [Applegate ’10] Location diversity even with random placement significantly enhances traditional TE [Sharma ’11]

Conclusions Keep it simple – Joint optimization performs worse than simple unplanned – Little room for improvement over simple unplanned Content placement matters more than routing in Network CDNs 23