Distributed Virtual Network Embedding System With Historical Archives and Set-Based Particle Swarm Optimization

Abstract

Virtual network embedding (VNE) is an important problem in network virtualization for the flexible sharing of network resources. While most existing studies focus on centralized embedding for VNE, distributed embedding is considered more scalable and suitable for large-scale scenarios, but how virtual resources can be mapped to substrate resources effectively and efficiently remains a challenging issue. In this paper, we devise a distributed VNE system with historical archives (HAs) and metaheuristic approaches. First, we introduce metaheuristic approaches to each delegation of the distributed embedding system as the optimizer for VNE. Compared to the heuristicbased greedy algorithms used in existing distributed embedding approaches, which are prone to be trapped in local optima, metaheuristic approaches can provide better embedding performance for these distributed delegations. Second, an archive-based strategy is also introduced in the distributed embedding system to assist the metaheuristic algorithms. The archives are used to record the up-to-date information of frequently repeated tasks. By utilizing such archives as historical memory, metaheuristic algorithms can further improve embedding performance for frequently repeated tasks. Following this idea, we incorporate the set-based particle swarm optimization (PSO) as the optimizer and propose the distributed VNE system with HAs and setbased PSO (HA-VNE-PSO) system to solve the VNE problem in a distributed way. HA-VNE-PSO is empirically validated in

Distributed Virtual Network Embedding for Software-Defined Networks Using Multiagent Systems

“…5. In the distributed approach [33,34], there are multiple substrate networks for computing the embedding function. Our solution is distinguished from them as it uses agents and runs in an SDN environment.…”

A Three-Level Recursive Differential Grouping Method for Large-Scale Continuous Optimization

“…• If there is any interaction, X 2 is divided into three equally-sized subsets X 21 , X 22 and X 23 . 1 Afterward, we detect the interaction between X 1 and each of subset of X 2 . This process will continue in a recursive manner so that all variables that interact with X 1 are detected and placed into X * .…”

“…L ARGE-SCALE continuous optimization problems (LSCOPs) become more and more popular in the practical applications [1]- [3]. Without loss of generality, a largescale continuous optimization problem can be defined as follows:…”

DPb-MOPSO: A Novel Dynamic Pareto bi-level Multi-Objective Particle Swarm Optimization Algorithm

“…R ECENTLY, the main issue facing optimization has focused on the challenging field of Dynamic Multi-Objective Problems (DMOPs) with two or three conflicting functions characterized by dynamic objectives, parameters and/or constraints. A great deal of research conducts on Multi-Objective Evolutionary Algorithms (MOEAs) for solving static single and multi-objective problems referred to as SOPs and MOPs respectively are adapted for DMOPs [9], [32], [33] using a powerful range of bio-inspired intelligent techniques like the Genetic Algorithm (GA) [15] and the Particle Swarm Optimization (PSO) [6], [28]- [30]. These algorithms are designed to resolve evolutionary stagnation issues.…”