A kind of optimization method, device and storage medium of virtual network mapping algorithm

Abstract

The invention relates to a method and device for optimizing a virtual network mapping algorithm. The method includes: encoding the solution of the problem, and generating an initial population; calculating the fitness of each individual; updating the population, performing selection operations, crossover Operation and mutation operation; select a predetermined number of individuals from the generated new population as the solution vector of the initial harmony memory; obtain a new harmony solution vector based on the three rules of HMRS, PAR, and random selection; update the memory ; Repeat the process of obtaining a new harmony solution vector and updating the memory bank until the maximum number of iterations is reached or the stop criterion is satisfied, and the loop is ended, and the optimal solution is output. The invention can improve the income of the physical network provider and the acceptance rate of the virtual network request while reducing the virtual network mapping cost, has higher global optimization ability and local search optimization ability, and the convergence speed is faster than the traditional genetic algorithm .

Description

technical field [0001] The invention relates to an optimization method and device for a virtual network mapping algorithm, and relates to the field of wireless communication networks. Background technique [0002] Network virtualization technology constructs user business requests into mutually isolated, diverse and heterogeneous virtual networks (Virtual Networks) through abstraction and reconstruction mechanisms, so that new network services and network protocols can run independently in virtual networks . A virtual network consists of a virtual node (Virtual Node, VN) and a virtual link (Virtual Link, VL), corresponding to the underlying physical nodes and physical paths. Generally, a single virtual network mapping problem can be decomposed into two sub-problems, namely virtual node mapping sub-problem and virtual link mapping sub-problem. [0003] The common algorithm used to solve the virtual network mapping problem in the prior art is the genetic algorithm. The genet...

AI Technical Summary

Problems solved by technology

[0003] The common algorithm used to solve the virtual network mapping problem in the prior art is the genetic algorithm. The local search and optimization ability of the genetic algorithm is poor, and improper parameter selection will seriously affect the quality of the solution.

Although the harmony search algorithm makes up for the shortcomings of the genetic algorithm, it has a slow convergence speed and a strong dependence on the initial memory bank.

Images