Cost-Aware Topological Decomposition of Virtual Network Function Forwarding Graphs

To realize a Network Service (NS) in a Network Function Virtualization (NFV) network, it is needed to form an ordered set of connected Virtual Network Functions (VNFs), commonly referred to as VNF Forwarding Graph (VNF-FG), and then embed it onto the substrate network. Forming a VNF-FG is a challeng...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE Global Communications Conference (Online) s. 5384 - 5390
Hlavní autoři: Azhdari, Azadeh, Ebrahimzadeh, Amin, Afrasiabi, Seyedeh Negar, Szabo, Robert, Mouradian, Carla, Li, Wubin, Glitho, Roch. H.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 04.12.2023
Témata:
Costs
Embedding Cost
Network function virtualization
Resource management
Simulation
Software
Software algorithms
Substrates
Virtual Network Function
VNF Decomposition
ISSN:2576-6813
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:To realize a Network Service (NS) in a Network Function Virtualization (NFV) network, it is needed to form an ordered set of connected Virtual Network Functions (VNFs), commonly referred to as VNF Forwarding Graph (VNF-FG), and then embed it onto the substrate network. Forming a VNF-FG is a challenging step of NFV resource allocation (NFV-RA), especially when the VNFs can be further decomposed into different sub-functions. In this paper, we propose a cost-aware algorithm to solve the problem of topological decomposition of VNF-FGs with the main objective of minimizing the embedding cost while satisfying the given service requirements. The simulation results indicate that our proposed algorithm outperforms the existing benchmark in terms of embedding cost, while being significantly scalable compared to the brute-force approach.
ISSN:2576-6813
DOI:10.1109/GLOBECOM54140.2023.10437838