Scalable and Cost Efficient Algorithms for Virtual CDN Migration

TL;DR

This paper presents scalable algorithms for virtual CDN migration that optimize resource use and performance in SDN/NFV networks, demonstrating efficiency through various scenarios and integration into a framework.

Contribution

It introduces two novel algorithms, OPAC and HPAC, for optimal and near-optimal vCDN migration, addressing scalability and cost efficiency challenges.

Findings

OPAC and HPAC outperform existing methods in migration cost and time

Algorithms are effective across different network scales

Integrated into SDN/NFV framework for practical deployment

Abstract

Virtual Content Delivery Network (vCDN) migration is necessary to optimize the use of resources and improve the performance of the overall SDN/NFV-based CDN function in terms of network operator cost reduction and high streaming quality. It requires intelligent and enticed joint SDN/NFV migration algorithms due to the evident huge amount of traffic to be delivered to end customers of the network. In this paper, two approaches for finding the optimal and near optimal path placement(s) and vCDN migration(s) are proposed (OPAC and HPAC). Moreover, several scenarios are considered to quantify the OPAC and HPAC behaviors and to compare their efficiency in terms of migration cost, migration time, vCDN replication number, and other cost factors. Then, they are implemented and evaluated under different network scales. Finally, the proposed algorithms are integrated in an SDN/NFV framework. Index Terms: vCDN; SDN/NFV Optimization; Migration Algorithms; Scalability Algorithms.