Dynamic placement of extended service function chains: Steiner-based approximation algorithms - IRT SystemX Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Dynamic placement of extended service function chains: Steiner-based approximation algorithms

Selma Khebbache
  • Fonction : Auteur
  • PersonId : 1002083
Makhlouf Hadji
Djamal Zeghlache

Résumé

This paper proposes Steiner-based algorithms to extend already deployed tenant slices or Virtualized Network Functions Forwarding Graphs (or Service Function Chains) as demand grows or additional services are appended to prior service functions and chains. The tenant slices are hosted by Network Function Virtualization Infrastructure (NVFI) providers that can make use of the proposed algorithms to extend tenant slices on demand for growing traffic loads and service extensions including protection and security services(such as extending a slice with a dedicated security slice). The paper proposes a Steiner-based ILP as an exact solution for small graphs and Steiner based approximation algorithms to improve scalability for larger problems.
Fichier principal
Vignette du fichier
Steiner-NFV-Four-Pages-V05.pdf (257.96 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01851804 , version 1 (16-10-2023)

Identifiants

Citer

Selma Khebbache, Makhlouf Hadji, Djamal Zeghlache. Dynamic placement of extended service function chains: Steiner-based approximation algorithms. LCN 2018: 43rd IEEE conference on Local Computer Networks, Oct 2018, Chicago, United States. pp.307-310, ⟨10.1109/LCN.2018.8638044⟩. ⟨hal-01851804⟩
157 Consultations
3 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More