Scalable and Cost Efficient Algorithms for Virtual CDN Migration

Hatem Ibn-Khedher, Makhlouf Hadji, Emad Abd-Elrahman, Hossam Afifi, Ahmed E. Kamal

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationProceedings - 2016 IEEE 41st Conference on Local Computer Networks, LCN 2016
PublisherIEEE Computer Society
Pages112-120
Number of pages9
ISBN (Electronic)9781509020546
DOIs
Publication statusPublished - 22 Dec 2016
Externally publishedYes
Event41st IEEE Conference on Local Computer Networks, LCN 2016 - Dubai, United Arab Emirates
Duration: 7 Nov 201610 Nov 2016

Publication series

NameProceedings - Conference on Local Computer Networks, LCN

Conference

Conference41st IEEE Conference on Local Computer Networks, LCN 2016
Country/TerritoryUnited Arab Emirates
CityDubai
Period7/11/1610/11/16

Keywords

  • Migration Algorithms
  • SDN/NFV Optimization
  • Scalability Algorithms
  • vCDN

Fingerprint

Dive into the research topics of 'Scalable and Cost Efficient Algorithms for Virtual CDN Migration'. Together they form a unique fingerprint.

Cite this