基于多链路故障的网络切片生存性算法

为了保证当底层网络的多条物理链路发生故障时用户业务能够不间断，提出一种基于多链路故障的网络切片生存性算法。通过区分切片上承载的业务类型，当高可靠低延迟切片请求到达后，将物理节点按节点重要度排序后进行映射，再对故障链路采用多备份路径算法，选取带宽资源消耗最少的路径依次对故障链路进行重映射，当高带宽切片请求到达后，采用广度优先搜索的节点映射算法，再通过多备份路径对故障链路进行恢复。仿真结果表明，该算法能够提高切片平均映射成功率、长期平均收益开销比、物理链路利用率和故障恢复率，缩短平均故障恢复时延。

Network slice survivability algorithm based on multiple link failures

This paper proposed a network slice survivability algorithm based on multiple link failures to ensure the continuity of user services when underlying network multi-link failed. By distinguishing the types of services carried on slices, the physical nodes are sorted according to the importance of the nodes and mapped when the request of ultra-reliable and low latency communication slice arrives. Then the faulty link adopted the algorithm of multiple backup paths. It selected the paths that consume the least bandwidth resources to remap the failure links in sequence to ensure service continuity on the slice. When the request of enhanced mobile broadband slice arrives, it adopted the breadth first search node mapping algorithm to recover the faulty link through multiple backup paths. Simulation results show that the algorithm can improve the average mapping success rate of slice, ratio of long-term average benefits to costs, physical link utilization rate, failure restoration rate, and shorten the average failure restoration delay.