Nothing Special   »   [go: up one dir, main page]

×
Please click here if you are not redirected within a few seconds.
We propose a meta-heuristic based on the Non-dominated Sorting Genetic Algorithm II (NSGA-II) to address the NP-Hard service function chain placement ...
People also ask
The proposed NSGA-II based algorithm finds a Pareto front to select solutions that meet the multiple objectives and performance tradeoffs of providers.
Abstract—We propose a meta-heuristic based on the Non- dominated Sorting Genetic Algorithm II (NSGA-II) to address the NP-Hard service function chain ...
This work considers the minimization of the mapping cost and of the physical links utilization for virtualized network functions (VNF) chaining and proposes ...
We propose a meta-heuristic based on the Non-dominated Sorting Genetic Algorithm II (NSGA-II) to address the NP-Hard service function chain placement ...
Apr 9, 2021 · Selma Khebbache, Makhlouf Hadji, Djamal Zeghlache : A multi-objective non-dominated sorting genetic algorithm for VNF chains placement.
Mar 11, 2024 · This work proposed framing the problem of VNFs scheduling and mapping as a multi-objective optimization problem on three objectives.
The purpose of this algorithm is to place VNFs based on different service chains onto physical hosts in such a way that, first, physical resource utilization is ...
We develop a multi-objective genetic algorithm that explores the Pareto front by balancing the optimality of the new placement and the cost to achieve it. Our ...
lution (denoted as FFD), which uses the non-dominated sorting genetic algorithm for VNF-SC deployment problem. The purpose of this algorithm is to place ...