Joint VNF Decomposition and Migration for Cost-Efficient VNF Forwarding Graph Embedding

Network Function Virtualization (NFV) enables the decoupling of network functions from dedicated hardware to run them as software instances on commodity servers through virtualization, replacing hardware-based network functions with software-based Virtual Network Functions (VNFs). In this paper, we...

Full description

Saved in:
Bibliographic Details
Published in:IEEE Global Communications Conference (Online) pp. 2863 - 2869
Main Authors: Afrasiabi, Seyedeh Negar, Ebrahimzadeh, Amin, Azhdari, Azadeh, Mouradian, Carla, Li, Wubin, Szabo, Robert, Glitho, Roch H.
Format: Conference Proceeding
Language:English
Published: IEEE 04.12.2023
Subjects:
Costs
Integer linear programming
Network function virtualization
Resource management
Servers
Software
Virtual Network Function
Virtualization
VNF Decomposition
VNF Forwarding Graph Embedding
VNF Migration
ISSN:2576-6813
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Network Function Virtualization (NFV) enables the decoupling of network functions from dedicated hardware to run them as software instances on commodity servers through virtualization, replacing hardware-based network functions with software-based Virtual Network Functions (VNFs). In this paper, we study the joint problem of VNF decomposition and migration to address VNF embedding in NFV resource allocation (NFV-RA). More specifically, we investigate how VNF migration and VNF decomposition can be mutually beneficial to minimize the embedding cost of network services. After presenting a novel formulation of the problem as an integer linear programming (ILP), we validate it by CPLEX and show that our joint VNF decomposition and migration approach can outperform the VNF decomposition-only approach by 20% in terms of embedding cost.
ISSN:2576-6813
DOI:10.1109/GLOBECOM54140.2023.10437348