摘要
基于Mesh光网络p-cycle保护算法,研究了常见简单p圈及空闲容量的相关性能,针对如何在光网络拓扑中优化配置p圈问题,提出了获得更多性能优良圈的圈扩展算法和基于空闲容量的p圈启发式分配算法．通过计算机仿真结果表明,该算法即实现快速容量配置又保证保护效能高,性能优于枚举算法,适合网状光网络中的 p圈配置．
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 optimization assignment of the candidate p-cycles. The basic types of p-cycle and the definition of spare capacity are introduced. The expanding algorithms are performed on the cycle to get more efficient p-cycles. We propose a novel heuristic algorithm of the p-cycles assignment based on spare capacity. Comparisons are made between (a) and (b) strategies of...
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2005年第S1期971-975,共5页
Journal of University of Electronic Science and Technology of China
基金
国家自然科学基金资助项目(6030210)
关键词
网状
光网络
P圈
保护
空闲容量
p圈分配
mesh
optical network
p-cycle
protection
spare capacity
p-cycle assignment
