New algorithm of finding good candidate cycles based on k shortest routing in optical mesh network
基于k最短路由的mesh光网络p圈构造方法*

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.