A dynamic programming algorithm for joint VNF placement and chaining

Chaima Ghribi, Marouen Mechtri, Djamal Zeghlache

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

Abstract

This paper addresses the problem of Virtualized Network Functions placement and traffic steering in Cloud infrastruc- tures. We design an efficient dynamic programming (DP) algorithm for joint VNF placement and traffic steering that runs in polynomial time. In compliance with dynamic pro- gramming approaches, we organize the problem in smaller interdependent subproblems (one per VNF in the requested chain) that are solved successively and aggregated to com- pose the overall chain placement. We demonstrate the po- tential of our solution by comparing it with a Multi-Stage approach and a greedy algorithm. Simulation results show that our dynamic programming algorithm achieves better performance in terms of resource usage, acceptance rate and cloud provider revenue.

Original languageEnglish
Title of host publicationCAN 2016 - Proceedings of the 2016 ACM Workshop on Cloud-Assisted Networking, co-located with CoNEXT 2016
PublisherAssociation for Computing Machinery, Inc
Pages19-24
Number of pages6
ISBN (Electronic)9781450346733
DOIs
Publication statusPublished - 12 Dec 2016
Externally publishedYes
Event1st ACM CoNEXT Workshop on Cloud-Assisted Networking, CAN 2016 - Irvine, United States
Duration: 12 Dec 2016 → …

Publication series

NameCAN 2016 - Proceedings of the 2016 ACM Workshop on Cloud-Assisted Networking, co-located with CoNEXT 2016

Conference

Conference1st ACM CoNEXT Workshop on Cloud-Assisted Networking, CAN 2016
Country/TerritoryUnited States
CityIrvine
Period12/12/16 → …

Keywords

  • Dynamic programming
  • Service functions chaining
  • VNF placement and chaining
  • Virtual-ized network function

Fingerprint

Dive into the research topics of 'A dynamic programming algorithm for joint VNF placement and chaining'. Together they form a unique fingerprint.

Cite this