Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Stable internet routing without global coordination
IEEE/ACM Transactions on Networking (TON)
On selfish routing in internet-like environments
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A measurement-based analysis of multihoming
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Optimizing cost and performance for multihoming
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A comparison of overlay routing and multihoming route control
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
MIRO: multi-path interdomain routing
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Drafting behind Akamai (travelocity-based detouring)
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
iPlane: an information plane for distributed services
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
On dominant characteristics of residential broadband internet traffic
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Moving beyond end-to-end path information to optimize CDN performance
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Dynamic route recomputation considered harmful
ACM SIGCOMM Computer Communication Review
The flattening internet topology: natural evolution, unsightly barnacles or contrived collapse?
PAM'08 Proceedings of the 9th international conference on Passive and active network measurement
The Akamai network: a platform for high-performance internet applications
ACM SIGOPS Operating Systems Review
YouTube traffic dynamics and its interplay with a tier-1 ISP: an ISP perspective
IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
Design, implementation and evaluation of congestion control for multipath TCP
Proceedings of the 8th USENIX conference on Networked systems design and implementation
Understanding the impact of video quality on user engagement
Proceedings of the ACM SIGCOMM 2011 conference
Quantifying the benefits of joint content and network routing
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
A toolchain for simplifying network simulation setup
Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques
Hi-index | 0.00 |
Internet delivery infrastructures are traditionally optimized for low-latency traffic, such as the Web traffic. However, in recent years we are witnessing a massive growth of throughput-oriented applications, such as video streaming. These applications introduce new tradeoffs and design choices for content delivery networks (CDNs). In this paper, we focus on understanding two key design choices: (1) What is the impact of the number of CDN's peering points and server locations on its aggregate throughput and operating costs? (2) How much can ISP-CDNs benefit from using path selection to maximize its aggregate throughput compared to other CDNs who only have control at the edge? Answering these questions is challenging because content distribution involves a complex ecosystem consisting of many parties (clients, CDNs, ISPs) and depends on various settings which differ across places and over time. We introduce a simple model to illustrate and quantify the essential tradeoffs in CDN designs. Using extensive analysis over a variety of network topologies (with varying numbers of CDN peering points and server locations), operating cost models, and client video streaming traces, we observe that: (1) Doubling the number of peering points roughly doubles the aggregate throughput over a wide range of values and network topologies. In contrast, optimal path selection improves the CDN aggregate throughput by less than 70\%, and in many cases by as little as a few percents. (2) Keeping the number of peering points constant, but reducing the number of location (data centers) at which the CDN is deployed can significantly reduce operating costs.