工作容量约束下光网络p圈空闲容量分配算法  

Novel Spare Capacity Allocation Algorithm of p-Cycles in Optical Mesh Network Subject to Working Capacity

作　　者：赵太飞[1] 李乐民[1] 虞红芳[1] 

机构地区：[1]电子科技大学宽带光纤传输与通信系统技术教育部重点实验室,四川成都610054

出　　处：《光电子．激光》2006年第9期1086-1091,共6页Journal of Optoelectronics·Laser

基　　金：国家自然科学基金资助项目(6030210)

摘　　要：基于网状光网络p圈保护算法,研究了常见简单p圈和空闲容量分配的常见问题,介绍了光网络中局部图概念,针对如何在光网络拓扑中优化配置p圈,提出获得更多性能优良圈的局部图扩展算法和工作容量约束下启发式p圈空闲容量分配算法。通过计算机仿真表明,该算法在考虑工作容量的分布情况下,既实现快速空闲容量配置又保证保护效能高。该算法性能优于基于空闲容量的启发式p圈分配算法,适合在给定空闲容量分布情况下的网状光网络高保护效能p圈的配置。The p-cycle is a promising approach for protecting working capacities in optical mesh networks. The most important problem in p-cycle network design is the optimal assignment of the candidate p-cycles. The basic types of p-cycle and the definitions of spare capacity and local-map are introduced. The local-map based expanding algorithms are performed on the cycle to get more efficient p-cycles. We propose a novel heuristic spare capacity allocation algorithm of the p-cycles with the limitation of working capacity. Comparisons are made between the heuristic algorithm of the p-cycles assignment based on spare capacity and our algorithm,the result shows that the performance of our algorithm is better. It can optimize assignment of p-cycles with good efficiency in the optical mesh networks.

关 键 词：网状 光网络 P圈 保护 空闲容量 工作容量 局部图 p圈分配 

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