Joint Optimization for the Delivery of Multiple Video Channels in Telco-CDNs

Abstract

Abstract-The delivery of live video channels for services such as twitch.tv leverages the so-called Telco-CDN-Content Delivery Network (CDN) deployed within the Internet Service Provider (ISP) domain. A Telco-CDN can be regarded as an intra-domain overlay network with tight resources and critical deployment constraints. This paper addresses two problems in this context: (1) the construction of the overlays used to deliver the video channels from the entrypoints of the Telco-CDN to the appropriate edge servers; and (2) the allocation of the required resources to these overlays. Since bandwidth is critical for entrypoints and edge servers, our ultimate goal is to deliver as many video channels as possible while minimizing the total bandwidth consumption. To achieve this goal, we propose two approaches: a two-step optimization where the optimal overlays are firstly computed, then an optimal resource allocation based on these pre-computed overlays is performed; and a joint optimization where both optimization problems are simultaneously solved. We also devise fast heuristic algorithms for each of these approaches. The conducted evaluations of these two approaches and algorithms provide useful insights into the management of critical Telco-CDN infrastructures.

Maximizing Revenue with Adaptive Modulation and Multiple FEC in Flexible Optical Networks

“…In this paper, we consider the service type parameter u i follows the Zipf distribution Zipf(1,5) [37]. The revenue of a network is sum of all accepted lightpaths' revenue.…”

Overlay routing for fast video transfers in CDN

“…Therefore, we cannot compute a multicast tree arbitrarily close to optimum in polynomial time, but we can only use schemes that compute a solution in polynomial time within an constant approximation factor like [21]. We observe that even if the algorithm will not converge to the optimal fractional solution of the multicast overlay routing problem, it can still improve the starting solution computed by a heuristic approach like the one proposed in [15].…”

“…Eq. (15) states that in a feasible point of the dual problem µ * = [λ * , σ * ], there exists no path for any demand such that σ * k > e∈p r k λ * e + d p , which can be rewritten as σ * k > e∈p (r k λ * e + d e ). In other words, there exists no path for any demand that can further improve the objective function (10).…”

“…Their primary objective is to optimize the cost of the infrastructure. Similarly, Zhou et al [15] proposed an algorithm to find capacity and delay bounded minimum cost overlay forests. Our work differs from state of art by focusing on delay minimization subject to constraints on jitter and packet loss.…”

Revenue Maximization Leveraging Elastic Service Provisioning in Flexible Optical Networks

“…latency tolerance, and bandwidth) and characteristics (revenue or importance). Luckily, some services are sensitive to the bandwidth and latency, while others services are elastic and operational when degrading the bit-rate [5,7]- [10], e.g. a lower resolution video or a longer file transfer time.…”