网络切片下基于粒子群的虚拟业务故障恢复算法

Virtual Service Failure Recovery Algorithm Based on Particle Swarm in Network Slicing

网络切片环境下,如何在有限资源约束下恢复尽可能多的虚拟网服务是一个急需解决的问题。为解决此问题,本文将虚拟网服务恢复问题建模为失效业务恢复数量最大化问题。提出了网络切片下基于粒子群的虚拟业务故障恢复算法,该算法首先将故障资源和虚拟业务构建为二层关联模型。其次将网络资源的恢复问题建模为粒子群问题,并采用粒子群优化算法进行求解。在实验部分,通过与已有算法进行比较,验证了本文算法能够恢复更多的发生故障的虚拟网业务。

In a network slicing environment, how to restore as many virtual network services as possible under the constraints of limited resources is an urgent problem to be solved. To solve this problem, this paper models the virtual network service recovery problem as a problem of maximizing the number of failed services recovery. A particle swarm-based virtual service failure recovery algorithm under network slicing is proposed. The algorithm first constructs the faulty resource and virtual service as a two-layer correlation model. Secondly, the network resource recovery problem is modeled as a particle swarm problem, and the particle swarm optimization algorithm is used to solve it. In the experimental part, by comparing with existing algorithms, it is verified that the algorithm in this paper can recover more virtual network services that have failed.