HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

A multi-objective non-dominated sorting genetic algorithm for VNF chains placement

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 placement problem. This work considers the minimization of the mapping cost and of the physical links utilization for virtualized network functions (VNF) chaining. The proposed NSGA-II based algorithm finds a Pareto front to select solutions that meet the multiple objectives and performance tradeoffs of providers. Simulation results and comparison with a multi-stage algorithm and a matrix based heuristic from the literature, highlight the efficiency and usefulness of the proposed NSGA-II-based approach.
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01613473
Contributor : Makhlouf Hadji Connect in order to contact the contributor
Submitted on : Monday, October 9, 2017 - 4:16:36 PM
Last modification on : Monday, April 11, 2022 - 2:00:02 PM

Identifiers

Citation

Selma Khebbache, Makhlouf Hadji, Djamal Zeghlache. A multi-objective non-dominated sorting genetic algorithm for VNF chains placement. CCNC 2018 : IEEE Consumer Communications & Networking Conference, Jan 2018, Las Vegas, United States. pp.1-4, ⟨10.1109/CCNC.2018.8319250⟩. ⟨hal-01613473⟩

Share

Metrics

Record views

244