Memetic Elitist Pareto Evolutionary Algorithm for Virtual Network Embedding

Abstract

Assigning virtual network resources to physical network components, called Virtual Network Embedding, is a major challenge in cloud computing platforms. In this paper, we propose a memetic elitist pareto evolutionary algorithm for virtual network embedding problem, which is called MEPE-VNE. MEPE-VNE applies a non-dominated sortingbased multi-objective evolutionary algorithm, called NSGA-II, to reduce computational complexity of constructing a hierarchy of non-dominated Pareto fronts and assign a rank value to each virtual network embedding solution based on its dominance level and crowding distance value. Local search is applied to enhance virtual network embedding solutions and speed up convergence of the proposed algorithm. To reduce loss of good solutions, MEPE-VNE ensures elitism by passing virtual network embedding solutions with best fitness values to next generation. Performance of the proposed algorithm is evaluated and compared with existing algorithms using extensive simulations, which show that the proposed algorithm improves virtual network embedding by increasing acceptance ratio and revenue while decreasing the cost incurred by substrate network.

A load balancing algorithm for solving multi‐objective virtual network embedding

“…Shahin 32 proposed Memetic elitist pareto evolutionary algorithm for virtual network embedding (MEPE‐VNE). On the basis of NSGA‐II algorithm, the method of keeping elite set is introduced in this algorithm, so that the solution with the best fitness value can be transferred to the next generation population, so as to prevent cross or mutation operators from randomly destroying the best solution, optimize the mapping scheme, and improve the revenue of service providers.…”

Optimal path calculation for virtual networks using genetic algorithm

“…Many papers studied meta-heuristic algorithms for the VNE problem. In [3], a genetic algorithm (GA) based on a non-dominated sorting based multiobjective evolutionary algorithm is introduced to the VNE problem. But the link path between nodes is calculated by a shortest path first (SPF) method which is based on Dijkstra's algorithm.…”