摘要
为了提高预置圈(P圈)先验效率,减少备选P圈个数,给出一种基于圈扩张策略的相交圈合并算法。利用跨接链路算法计算基础P圈,在其中找出两个相交P圈,以及它们之间的相交节点,对其进行相加合并,生成新的P圈。以先验效率为筛选标准,将性能较好的新P圈加入备选P圈,丢弃性能较差的P圈。针对Italy和Cost239两个网络拓扑进行算法仿真,结果表明,所给算法能够提高P圈先验效率,并将备选P圈个数减少一半,性能优于P圈启发式构造算法中的扩展算法(Grow Algorithm)。
In order to increase the prior efficiency of pre-configuration cycle（P-cycle）, and reduce the number of candidate P-cycles, an intersecting cycles merge algorithm based on cycle expansion strategy is proposed. Firstly, the straddling link algorithm is used to calculate the basic P-cycles. Secondly, two intersecting P-cycles with their intersection nodes are found from the basic P-cycles, and merged into a new one. Thirdly, the prior efficiency is chosen as the standard, the better performance of the new P-cycle is combined with candidate P-cycles, and the poor performance of P-cycle is discarded. Simulation on Italy and Cost239 network topologies show that, the new algorithm can increase the prior efficiency of P-cycles and also reduce the number of candidate P-cycles more than half. better than that of the Grow algorithm. Therefore the performance of new algorithm is
出处
《西安邮电大学学报》
2015年第4期29-31,共3页
Journal of Xi’an University of Posts and Telecommunications
基金
国家自然科学基金资助项目(61340040
61202183)
关键词
光网络
生存性
预置圈
先验效率
optical networks, survivability, P-cycle, prior efficiency
