基于k-最短路由的mesh光网络p圈构造方法  

New algorithm of finding good candidate cycles based on k-shortest-routing in optical mesh network

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

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

出　　处：《计算机应用研究》2007年第11期278-280,共3页Application Research of Computers

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

摘　　要：P-cycle是mesh光网络中一种十分优秀的保护算法,圈构造算法是p圈法设计的前提。首先介绍了圈的概念及常见圈构造算法和基于k-最短路由的p圈启发式算法,提出了基于k-最短路改进metaDijkstra的圈构造算法。实验仿真表明该方案比较适合网状光网络中的圈构造。P-cycle is a promising approach for protecting working capacities in optical mesh networks. The first and the most important problem in p-cycle network design is to find a set of p-cycles. This paper introduced the definition of cycle and several finding cycles algorithms. Analyzed the algorithms based on k-shortest-routing of finding good candidate cycles. Proposed a new finding cycles algorithm based on improved metaDijkstra algorithm. Made a comparisons between this algorithm and the other k-shortest-routing algorithms. The result is that the improved metaDijkstra algorithm can find more candidate cycles with good efficiency in optical mesh networks.

关 键 词：网状 光网络 P圈 保护 k-最短路由 圈构造 

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