Dynamic Strategies for Flow Scheduling in Multihoming Video CDNs

Multihoming for a video Content Delivery Network (CDN) allows edge peering servers to deliver video chunks through different Internet Service Providers (ISPs), to achieve an improved quality of service (QoS) for video streaming users. However, since traditional strategies for a multihoming video CDN are simply designed according to static rules, e.g., simply sending traffic via a ISP which is the same as the ISP of client, they fail to dynamically allocate resources among different ISPs over time. In this paper, we perform measurement studies to demonstrate that such static allocation mechanism is inefficient to make full utilization of multiple ISPs’ resources. To address this problem, we propose a dynamic flow scheduling strategy for multihoming video CDN. The challenge is to find the control parameters that can guide the ISP selection when performing flow scheduling. Using a data-driven approach, we find factors that have a major impact on the performance improvement in the dynamic flow scheduling. We further utilize an information gain approach to generate parameter combinations that can be used to guide the flow scheduling, i.e., to determine the ISP each request should be responded by. Our evaluation results demonstrate that our design effectively performs the flow scheduling. In particular, our design yields near optimal performance in a simulation of real-world multihoming setup.

[1]  Srinivasan Seshan,et al.  Developing a predictive model of quality of experience for internet video , 2013, SIGCOMM.

[2]  Nick Feamster,et al.  Quantifying the benefits of joint content and network routing , 2013, SIGMETRICS '13.

[3]  Anees Shaikh,et al.  On the Performance Benefits of Multihoming Route Control , 2008, IEEE/ACM Transactions on Networking.

[4]  Anees Shaikh,et al.  A measurement-based analysis of multihoming , 2003, SIGCOMM '03.

[5]  Wenwu Zhu,et al.  Two decades of internet video streaming: A retrospective view , 2013, TOMCCAP.

[6]  Amogh Dhamdhere,et al.  ISP and Egress Path Selection for Multihomed Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[7]  Daniel Genin,et al.  Where in the Internet is congestion? , 2013, ArXiv.

[8]  Yin Zhang,et al.  Optimizing cost and performance for multihoming , 2004, SIGCOMM 2004.

[9]  William Chan,et al.  Improving Traffic Locality in BitTorrent via Biased Neighbor Selection , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[10]  Minlan Yu,et al.  Tradeoffs in CDN designs for throughput oriented traffic , 2012, CoNEXT '12.

[11]  Li Xiao,et al.  A Survey of Multihoming Technology in Stub Networks: Current Research and Open Issues , 2007, IEEE Network.

[12]  Mikkel Thorup,et al.  Intra-domain traffic engineering with shortest path routing protocols , 2013, Ann. Oper. Res..

[13]  Jia Wang,et al.  Locating internet bottlenecks: algorithms, measurements, and implications , 2004, SIGCOMM 2004.

[14]  Lifeng Sun,et al.  CPCDN: Content Delivery Powered by Context and User Intelligence , 2015, IEEE Transactions on Multimedia.

[15]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.