An Efficient Heuristic for the Virtual Network Function Reconfiguration Problem - Archive ouverte HAL
Communication Dans Un Congrès Année : 2022

An Efficient Heuristic for the Virtual Network Function Reconfiguration Problem

Résumé

In this paper, we propose an efficient heuristic for the Virtual Network Function (VNF) reconfiguration problem in the context of 5G network slicing. This problem consists in reallocating the VNFs to fit the network changes, by transforming the current state of deployed services, e.g., the current placement of Virtual Machines (VM) that host VNFs, to another state that updates providers’ objectives. We rely on the topological sorting algorithm and the Feedback Arc Set (FAS) problem to build our heuristic which is an alternative of an Integer Linear Programming (ILP) solution that we have already proposed in [1]. Experimental results show that our heuristic solves the problem in a few seconds even for large network infrastructures.
Fichier non déposé

Dates et versions

hal-03898893 , version 1 (14-12-2022)

Identifiants

Citer

Hanane Biallach, Mustapha Bouhtou, Dritan Nace, Mohamed Salah Mimouna. An Efficient Heuristic for the Virtual Network Function Reconfiguration Problem. 12th International Workshop on Resilient Networks Design and Modeling (RNDM 2022), Sep 2022, Compiègne, France. pp.1-7, ⟨10.1109/RNDM55901.2022.9927661⟩. ⟨hal-03898893⟩
39 Consultations
0 Téléchargements

Altmetric

Partager

More