基于链路容量有限的启发式p圈容量分配算法

As previous heuristic p-cycle capacity allocation algorithms fail to consider the limitation of link capacity, we propose a new heuristic algorithm. On the basis of spare capacity, this algorithm constructs a p-cycle by taking the maximum working capacity as the expansion standard and uses the constructed p-cycle for capacity allocation and uses COST239 network topology for algorithm simulation. The simulation results show that this algorithm can use less spare capacity to protect more working capacity and reduce the number of p-cycles.

参考文献

[1] Stamatelakis D, Grover W D. Theoretical Underpinnings for the Efficiency of Restorable Networks Using Preconfigured Cycles (“p-cycles”) [J].IEEE Transactions on Communications ,2000,8(8)：1262-1265.

[2] Mohammad S, Chadi Assi. A Survey on the P-cycle Protection Method [J].IEEE Communications Survey & Tutorials ,2009,11(3)：53-70.

[3] Metnani A, Jaumard B. Dynamic Provisioning and Stability of p-Cycles in WDM Networks [J]. IEEE/OSA Optical Communications and Networking ，2011, 3(9)： 713-724.

[4] Kodian A, Grover W D. Failure-Independent Path-Protecting p -Cycles: Efficient and Simple Fully Preconnected Optical-Path Protection[J].Journal of Lightwave Technology,2005,10(10)：3241-3259.

[5] Doucette J, He D, Grover W D, et al. Algorithmic approaches for efficient enumeration of candidate P-cycles and capacitated P-cycle network design [ A] . In Proceedings of Fourth International Workshop on the Design of Reliable Communication Networks (DRCN2003) [ C] . Canada: IEEE, 2003. 212-220.

丁玉龙, 吴雯婷, 徐荣青. 基于链路容量有限的启发式p圈容量分配算法[J]. 光通信研究, 2014, 40(1): 9. Ding Yulong, Wu Wenting, Xu Rongqing. A link-capacity limited heuristic p-cycle capacity allocation algorithm[J]. Study On Optical Communications, 2014, 40(1): 9.

基于链路容量有限的启发式p圈容量分配算法

关于本站 Cookie 的使用提示

全站搜索

基于链路容量有限的启发式p圈容量分配算法

相关论文

相关资讯

关于本站 Cookie 的使用提示

全站搜索