A dynamic programming algorithm for joint VNF placement and chaining - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

A dynamic programming algorithm for joint VNF placement and chaining

Résumé

This paper addresses the problem of Virtualized Network Functions placement and traffic steering in Cloud infrastructures. We design an efficient dynamic programming (DP) algorithm for joint VNF placement and traffic steering that runs in polynomial time. In compliance with dynamic programming approaches, we organize the problem in smaller interdependent subproblems (one per VNF in the requested chain) that are solved successively and aggregated to compose the overall chain placement. We demonstrate the potential 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
Fichier non déposé

Dates et versions

hal-01462061 , version 1 (08-02-2017)

Identifiants

Citer

Chaima Ghribi, Marouen Mechtri, Djamal Zeghlache. A dynamic programming algorithm for joint VNF placement and chaining. CAN 2016 : Workshop on Cloud-Assisted Networking, Dec 2016, Irvine, United States. pp.19 - 24 ⟨10.1145/3010079.3010083⟩. ⟨hal-01462061⟩
170 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More