An efficient algorithm for virtual network function scaling - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

An efficient algorithm for virtual network function scaling

Omar Houidi
  • Fonction : Auteur
  • PersonId : 1042003
Oussama Soualah
  • Fonction : Auteur
Wajdi Louati
  • Fonction : Auteur
Marouen Mechtri
  • Fonction : Auteur
Farouk Kamoun
  • Fonction : Auteur

Résumé

Network Functions Virtualization (NFV) has been revolutionizing and improving the way networking services are deployed but also requires the dynamic scaling of resources during the lifecycle management of Virtual Network Functions (VNFs) with increasing service demand. We propose an Integer Linear Programming (ILP) approach and a Greedy heuristic to address this NP-Hard scaling problem. Both horizontal (scale out/in) and vertical (scale up/down) scaling are considered and the scalability of the ILP is addressed by reducing the number of candidate hosts in the search space. Extensive simulations evaluate the performance of the algorithms in successful scalings and VNF migrations and highlight the importance of using the algorithms to tidy up the infrastructure to accept more users. The results show that the ILP can outperform the Greedy heuristic if appropriate actions are selected.
Fichier principal
Vignette du fichier
An_Efficient_Algorithm_for_Virtual_Netwo.pdf (225.89 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04404193 , version 1 (18-01-2024)

Identifiants

Citer

Omar Houidi, Oussama Soualah, Wajdi Louati, Marouen Mechtri, Djamal Zeghlache, et al.. An efficient algorithm for virtual network function scaling. 2017 IEEE Global Communications Conference (GLOBECOM 2017), Dec 2017, Singapore, France. pp.1-7, ⟨10.1109/GLOCOM.2017.8254727⟩. ⟨hal-04404193⟩
5 Consultations
4 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More