基于矩阵计算的互斥组业务的不相交路径选择算法  

A disjoint path selection scheme of mutex group businesses based on matrix calculation

作　　者：柯磊 何峰 KE Lei;HE Feng(Department of Telecommunications,Wuhan Research Institute of Post&Telecommunications,Wuhan 430073,China;FiberHome Telecommunication Technologies Co.,Ltd.,Wuhan 430073,China)

机构地区：[1]武汉邮电科学研究院电信系,湖北武汉430073 [2]烽火通信科技股份有限公司,湖北武汉430073

出　　处：《电子设计工程》2021年第22期33-37,共5页Electronic Design Engineering

摘　　要：针对带共享风险链路组(SRLG)约束的光网络(OTN)中,互斥组业务的不相交路径选择问题,文中在排斥链路然后逐条计算业务路径方法的基础上,引入矩阵计算的概念,提出一种新的方法来为互斥组中的每条业务规划路径和网络资源。在文中给出了算法实现的流程以及相应的伪代码,并对不相交路径选择问题中所涉及的关键性指标给出实验对比分析的结果。测试结果表明该算法可以提高互斥组中业务的算出数,有效地为光网络中的互斥组业务规划不相交路径。Aiming at the problem of disjoint path selection of mutex group businesses in Optical Transport Network(OTN)with Shared Risk Link Group(SRLG)constraint,the concept of matrix calculation is introduced based on the method of exclusive link and calculating the traffic path one by one,a new method is proposed to plan the path and network resources for each business in a mutex group.The flow chart of the algorithm and the corresponding pseudocode are given,and the experimental results of the key indicators involved in the disjoint path selection problem are given.The experimental results show that the algorithm can increase the number of operations in the mutex group and effectively plan the disjoint paths for the mutex group operations in the Optical Transport Network.

关 键 词：光网络 共享风险链路组 不相交路径选择 矩阵计算 

分 类 号：TN929[电子电信—通信与信息系统]