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

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) chaini...

Full description

Saved in:
Bibliographic Details
Main Authors: Khebbache, Selma, Hadji, Makhlouf, Zeghlache, Djamal
Format: Conference Proceeding
Language:English
Subjects:
Bandwidth
Chains Placement
Conferences
Forwarding Graph
Genetic algorithms
NFV
NSGA-II
Optimization
Servers
Sociology
Statistics
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-9860
DOI:10.1109/CCNC.2018.8319250