Dynamic Flow Scheduling Strategy in Multihoming Video CDNs
Ming Ma, Zhi Wang, Yankai Zhang, Lifeng Sun

TL;DR
This paper introduces a dynamic flow scheduling strategy for multihoming video CDNs that adaptively allocates resources across multiple ISPs, significantly improving performance over static methods.
Contribution
It proposes a data-driven, parameter-guided dynamic flow scheduling approach for multihoming video CDNs, addressing inefficiencies of static allocation strategies.
Findings
Achieves near-optimal performance in simulations
Demonstrates significant resource utilization improvements
Validates effectiveness through real-world setup simulations
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Peer-to-Peer Network Technologies · Image and Video Quality Assessment
