节点与链路协同映射的生存性虚拟光网络映射算法  

Survivable Virtual Optical Network Mapping Algorithm for Joint Mapping Between Nodes and Links

作　　者：朱国晖 梁申麟 李庆 ZHU Guohui;LIANG Shenlin;LI Qing(School of Communication and Information Engineering,Xi’an University of Posts and Telecommunications,Xi’an 710121,China)

机构地区：[1]西安邮电大学通信与信息工程学院,西安710121

出　　处：《计算机工程》2021年第11期220-226,共7页Computer Engineering

基　　金：国家自然科学基金(61371087)。

摘　　要：针对弹性光网络中单链路故障问题,提出一种基于匈牙利算法求解链路映射方案的节点与链路协同映射保护算法CMST-HA。将虚拟网络请求的节点与链路分别划分为主动类型与被动类型,把主动类型节点映射至邻接链路频谱资源丰富且邻接节点计算资源充足的物理节点上,在主动链路时使用匈牙利算法求解出最小映射开销方案并完成映射,确定被动节点的映射位置,利用KSP算法为被动链路选择映射路径,在此基础上为虚拟网络请求的最小生成树链路提供备份路径。仿真结果表明,与RVNM、CMST算法相比,CMST-HA算法不仅能够降低虚拟网络请求阻塞率,而且可增加物理网络收益。To address the problem of single link failure in Elastic Optical Networks(EON),a node-link cooperative mapping protection algorithm(CMST-HA)based on the Hungarian algorithm is proposed to solve the link mapping scheme.The algorithm divides the nodes and links that are requested by the virtual network into active and passive types respectively.The active nodes are mapped to physical nodes whose adjacent links have abundant spectrum resources and whose adjacent nodes have sufficient computing resources.The Hungarian algorithm is used to solve the minimum mapping cost scheme for the active link and complete the mapping.The mapping position of the passive node is also determined.Then the KSP algorithm is used to select the mapping path for the passive link.On this basis,a backup path is provided for the minimum spanning tree link requested by the virtual network.Simulation results show that compared with RVNM and CMST algorithms,the CMSTHA algorithm not only reduces the blocking rate of virtual network requests but also increases the benefit of physical network.

关 键 词：弹性光网络 虚拟网络 生存性 频谱分配 路径保护 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]