A multi-objective non-dominated sorting genetic algorithm for VNF chains placement - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

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.
No file

Dates and versions

hal-01613473 , version 1 (09-10-2017)

Identifiers

Cite

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⟩
253 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More