首页 | 本学科首页   官方微博 | 高级检索  
     

基于SRLG不相关陷阱避免算法的研究
引用本文:张琦,徐林,孙杰,林鹏飞. 基于SRLG不相关陷阱避免算法的研究[J]. 微型机与应用, 2011, 30(13): 39-41
作者姓名:张琦  徐林  孙杰  林鹏飞
作者单位:1. 四川大学计算机学院,四川成都,610065
2. 四川大学物理科学与技术学院,四川成都,610065
3. 阿尔卡特朗讯公司,四川成都,610041
摘    要:在光网络通信中,计算路由常常会出现共享风险链路组(SRLG)分离和"陷阱"问题。针对这种现象,提出了一种基于SRLG不相关的陷阱避免算法,并采用阿尔卡特朗讯公司的光网络规划工具1356NT进行验证。实验结果表明,与传统路由算法相比,该算法不但缩短了恢复时间,还有效提高了网络连接的可靠性和网络资源的利用率。

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

Research on the trap avoidance algorithm based on the uncorrelated shared risk link groups
Zhang Qi,Xu Lin,Sun Jie,Lin Pengfei. Research on the trap avoidance algorithm based on the uncorrelated shared risk link groups[J]. Microcomputer & its Applications, 2011, 30(13): 39-41
Authors:Zhang Qi  Xu Lin  Sun Jie  Lin Pengfei
Affiliation:Zhang Qi 1,Xu Lin 1,Sun Jie 2,Lin Pengfei 3 (1.College of Computer Science,Sichuan University,Chengdu 610065,China,2.College of Physical Science and Technology,3.Alcatel-Lucent Company,Chengdu 610041,China)
Abstract: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 n...
Keywords:optical network  SRLG  trap avoidance  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号