基于SRLG不相关陷阱避免算法的研究  

Research on the trap avoidance algorithm based on the uncorrelated shared risk link groups

作　　者：张琦[1] 徐林[1] 孙杰[2] 林鹏飞[3] 

机构地区：[1]四川大学计算机学院,四川成都610065 [2]四川大学物理科学与技术学院,四川成都610065 [3]阿尔卡特朗讯公司,四川成都610041

出　　处：《微型机与应用》2011年第13期39-41,共3页Microcomputer & Its Applications

摘　　要：在光网络通信中,计算路由常常会出现共享风险链路组(SRLG)分离和"陷阱"问题。针对这种现象,提出了一种基于SRLG不相关的陷阱避免算法,并采用阿尔卡特朗讯公司的光网络规划工具1356NT进行验证。实验结果表明,与传统路由算法相比,该算法不但缩短了恢复时间,还有效提高了网络连接的可靠性和网络资源的利用率。During the optical network communication, it often appears SRLG （shared risk link group） separation and the ＂trap＂ problems in the process of calculating route. To solve these problems, a new trap avoidance algorithm based on uncorrelated shared risk link groups is put forward in this paper, and a validation on this algorithm is performed on the 1356NT which is an optical network planning tool in Alcatel-Lucent company. The operation result shows that compared with traditional routing algorithm, the new algorithm not only shorts the restoration time, but also effectively improves the reliability of network connection and usability of network resource.

关 键 词：光网络 共享风险链路组 陷阱避免 

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