The Knapsack-Based Genetic Algorithm for Solving the Virtual Network Functions Placement and Chaining Problem
Engineering, Technology & Applied Science Research · 06.06.2026 · 16 (3) · 36600-36607
DOI: 10.48084/etasr.17874 ↗Kurz gefasst
Fachartikel in der Zeitschrift Engineering, Technology & Applied Science Research, online erschienen am 06.06.2026. Verfasst von Vu Ngoc Hoa und 2 weiteren Autor:innen. Die Arbeit nennt 12 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
In the context of digital transformation and the advent of 5G/6G networks, Network Function Virtualization (NFV) and Software-Defined Networking (SDN) serve as foundational pillars. However, resource management in such environments introduces significant challenges to the Virtual Network Functions Placement and Chaining (VNF-PC) problem. This problem is NP-hard and requires a careful balance among operational cost, network performance, and quality of service. This paper presents an in-depth study of VNF-PC, thoroughly analyzing existing techniques such as Integer Linear Programming (ILP) models, Benders decomposition, and heuristic algorithms. Building on these foundations, a novel approach is proposed, named the Knapsack-Based Genetic Algorithm (KBGA). This method models the placement of VNFs onto physical servers as a multidimensional knapsack optimization problem, combined with a hybrid initialization strategy to accelerate convergence. Simulation results demonstrate that KBGA improves request acceptance rates by up to 20% compared to traditional greedy algorithms under high-load conditions, while simultaneously reducing network operational costs.
Zitieren
APA
Hoa, V. N., Vinh, L. T., & Anh, N. H. (2026). The Knapsack-Based Genetic Algorithm for Solving the Virtual Network Functions Placement and Chaining Problem. Engineering, Technology & Applied Science Research, 16(3), 36600-36607. https://doi.org/10.48084/etasr.17874
Vancouver
Hoa VN, Vinh LT, Anh NH. The Knapsack-Based Genetic Algorithm for Solving the Virtual Network Functions Placement and Chaining Problem. Engineering, Technology & Applied Science Research. 2026;16(3):36600-36607. doi:10.48084/etasr.17874
BibTeX
@article{Hoa2026,
author = {Hoa, Vu Ngoc and Vinh, Le Trong and Anh, Ngo Hai},
title = {The Knapsack-Based Genetic Algorithm for Solving the Virtual Network Functions Placement and Chaining Problem},
journal = {Engineering, Technology & Applied Science Research},
year = {2026},
volume = {16},
number = {3},
pages = {36600--36607},
doi = {10.48084/etasr.17874}
}
EUVIMED