期刊文献+

基于冗余度和方差的P-Cycle圈构造算法的研究 被引量:1

Study of Redundancy and Variance Based P-Cycle Construction Algorithm
在线阅读 下载PDF
导出
摘要 铁路光传送网络是高速铁路地面基础设施的神经中枢,为避免网络故障给铁路运营带来巨大损失,重点研究光传送网P-Cycle(Pre-configured Cycle)保护技术,提出在圈扩展时以所有候选圈上未保护工作容量的方差、冗余度两个指标为比较标准的RVPA(Redundancy and Variance Based P-Cycle Construction Algorithm)算法。圈扩展的过程中,算法将选择方差与冗余度能同时满足条件的候选圈作为本轮扩展圈,有效限制了完成保护的P-Cycle圈个数;圈扩展停止条件中,当UPL与参数M、冗余度的大小关系满足条件时,则停止圈扩展,从而限制圈上节点数,使圈个数与圈长度得到有效均衡;在仿真过程中,利用泛欧网络拓扑COST239对RVPA算法进行仿真,并对比分析不同M值下的性能。仿真结果表明,在相同空闲资源与待保护工作容量设定下,参数M取0.5时效果最优,并且RVPA算法的保护容量效率、所需圈的个数、算法整体耗时、总冗余度均优于已有的POCA(P-Cycle Optimization Configuration Heuristic Algorithm)算法。 Railway optical transport network is the nerve center of high-speed railway ground facilities.In order to avoid the severe loss to the railway operation caused by the network failure,this paper focused on the P-Cycle protection technology of the optical transport network,and proposed a new P-Cycle construction algorithm RVPA(Redundancy and Variance Based P-Cycle Construction Algorithm),which is based on the redundancy and variance of unprotected working capacity on all candidate circles.In the process of circle expansion,the algorithm selected the candidate circle whose variance and redundancy can satisfy the condition at the same time as the current round of expansion circle,which effectively limited the total number of the P-Cycle circles to protect the entire network.Under the circle expansion stop condition,when the values of unprotected-links(UPL),the parameter M and the redundancy satisfied the criterion,the circle expansion was stopped to limit the number of nodes on the circle to effectively balance the number and the length of the circle.Finally,the COST239 European Optical Network(EON)topology model was used to test the efficiency of RVPA with different M values.The results show that under the setting of the same free resources and working capacity,the optimal performance is obtained when M is 0.5 and that RVPA algorithm is superior to POCA(P-Cycle Optimization Configuration Heuristic Algorithm)in terms of protection capacity efficiency,the number of required circles,and overall algorithm time-consuming and total redundancy.
作者 孙强 李德莉 任叶 SUN Qiang;LI Deli;REN Ye(School of Electronics and Information Engineering,Beijing Jiaotong University,Beijing 100044,China)
出处 《铁道学报》 EI CAS CSCD 北大核心 2018年第12期101-107,共7页 Journal of the China Railway Society
基金 国家自然科学基金(U1534201)
关键词 生存性 P-Cycle保护 P-Cycle圈扩展算法 资源占用 保护容量效率 survivability P-Cycle protection P-Cycle expansion algorithm resource occupancy protection capacity efficiency
  • 相关文献

参考文献3

二级参考文献15

  • 1Grover W D,Stamatelakis D.Cycle-oriented distributed pre-configuration:ring-like speed with mesh-like capacity for self-planning network restoration[A].Proc of IEEE International Conference on Communications 1998[C].Atlanta:IEEE,1998.537-543.
  • 2Shen Gangxiang,Grover W D.Design and performance of protected working capacity envelopes based on p-cycles for dynamic provisioning of survivable services[J].Journal of Optical Networking,2005,4(7):361-390.
  • 3Kang B,Habibi D,LO K,et al.An approach to generate an efficient set of candidate p-cycles in WDM Mesh Networks[A].Proc of IEEE Asia-Pacific Conference on Communications 2006[C].Busan:IEEE,2006.1-5.
  • 4Zhang H,Yang O.Finding protection cycles in DWDM networks[A].In Proceedings of IEEE International Conference on Communications (ICC) 2002[C].New York:IEEE,2002.2 756-2 760.
  • 5Doucette 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..
  • 6Grover W D, Stamatelakis D. Cycle-oriented distribu- ted preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration [A]. ICC'981[C]. Atlanta, USA: IEEE, 1998. 537-543.
  • 7Mohammad S, Chadi Assi. A Survey on the P-cycle Protection Method [J]. IEEE Communications Survey Tutorials, 2009,11 (3) : 53-70.
  • 8lraschko R, MacGregor M H, Grover W D. Optimal capacity placement for path restoration in mesh surviv- able networks [A]. ICC' 96 [C]. Dallas, Texas, USA:IEEE, 1996. 1568-1574.
  • 9Shen Gangxiang, Grover W D. Design and perform- ance of protected working capacity envelopes based on p-cycles for dynamic provisioning of survivable services [J]. Journal of Optical Networking, 2005, 4(7) : 361- 390.
  • 10Metnani Ammar, Jaumard Brigitte. Dynamic Provisio- ning and Stability of p-Cycles in WDM Networks [J]. Optical Communications and Networking, 2011, 3(9) :713-724.

共引文献3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部