抗毁WDM光网络中SRLG约束下p-Cycles配置算法  

A p-cycles assignation algorithm with SRLG constraints in survivable WDM optical networks

作　　者：赵太飞[1] 柯熙政[1] 

机构地区：[1]西安理工大学自动化与信息工程学院,陕西西安710048

出　　处：《光电子．激光》2009年第9期1158-1162,共5页Journal of Optoelectronics·Laser

基　　金：中国博士后科学基金资助项目(20080441179);国防重点实验室基金资助项目(9140C3601010901);陕西省教育厅科技专项基金资助项目(08JK386;07JK332)

摘　　要：基于共享风险链路组(SRLG,shared risk link group)和P圈(P-Cycles,pre-configured cycles)的概念,研究了SRLG约束下p-Cycles的构造问题,引入SRLG完全分离p-Cycles的概念,基于SRLG的简单p-Cycles构造算法和获得更多p-Cycles的SRLG约束下的圈扩展算法提出的SRLG约束下的p-Cycles配置算法(SCAA),实现在光网络中优化配置SRLG完全分离的p-Cycles。通过计算机仿真表明,SCAA最小容量配置方案可以预留更少的网络资源,而SCAA优化容量配置方案可以实现p-Cycles快速配置容量,SCAA算法可以保障配置SRLG分离p-Cycles的高保护效能,使网络具备单SRLG故障恢复能力。Based on the concept of shared risk Link group(SRLG) and p-Cycles,the definition of SRLG diverse p-Cycles is introduced.The expanding cycle algorithms with the SRLG constraints can get more SRLG diverse p-Cycles.We propose the SRLG p-Cycles assignation algorithm(SCAA) for the SRLG diverse p-Cycles optimum assignment in survivable WDM mesh networks.The minimal capacity allocation method of SCAA needs little reserved resources while the optimum capacity allocation method of SCAA can finish the p-Cycles assign...

关 键 词：光网络 生存性 共享风险链路组(SRLG) P圈(p-Cycles) 

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