Adaptive Network Slicing Control Method for Unpredictable Network Variations Using Quality-Diversity Algorithms

Network slicing technology is required to dynamically provide virtual networks in response to user requirements with a wide variety of services operating on the network. Generally, optimal allocation of virtual networks to resources on the real network is a combinatorial optimization problem, and it is difficult to find an exact solution in realistic time in the current large-scale and complex networks. In addition, user requirements change dynamically, and therefore, optimization methods that can cope with such temporal variations in the situation are required. In this paper, we propose a method to solve a virtual network embedding problem using quality-diversity (QD) algorithms, especially the MAP-Elites algorithm, and evaluate its effectiveness through computer simulations.