{"title":"基于扩展环约束的p环构造算法研究","authors":"Qiang Sun, Mingming Dong, Yang Zhou","doi":"10.1109/OGC.2019.8925238","DOIUrl":null,"url":null,"abstract":"P-Cycle protection technology is an important technology in optical network protection. This paper proposes a new P-Cycle construction algorithm ERPA (Extended cycle Restriction Based P-Cycle Construction Algorithm), which is based on the variance, mean and redundancy of unprotected working capacity on all candidate cycles. In the process of cycle expansion, the algorithm chooses the extended candidate cycle whose variance, mean and redundancy satisfy the conditions as the final candidate cycle of the current round, which can guarantee the quality of the extended cycle and limit the number of P-Cycle cycles that complete the protection; When the values of unprotected-links(UPL), the redundancy, mean and the parameter n satisfy the stop condition, the cycle expansion is stopped, so that the number of cycles and the cycle length can be effectively balanced. In the simulation process, the ERPA algorithm is simulated by using the COST293 European Optical Network (EON) topology model, and the performance under different n values is compared and analyzed. The simulation results show that ERPA algorithm needs fewer cycles, has higher protection capacity efficiency and lower total time consumption under the same resource and work capacity, which makes the proposed algorithm more feasible and effective.","PeriodicalId":381981,"journal":{"name":"2019 IEEE 4th Optoelectronics Global Conference (OGC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Study of Extended Cycle Restriction Based P-Cycle Construction Algorithm\",\"authors\":\"Qiang Sun, Mingming Dong, Yang Zhou\",\"doi\":\"10.1109/OGC.2019.8925238\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"P-Cycle protection technology is an important technology in optical network protection. This paper proposes a new P-Cycle construction algorithm ERPA (Extended cycle Restriction Based P-Cycle Construction Algorithm), which is based on the variance, mean and redundancy of unprotected working capacity on all candidate cycles. In the process of cycle expansion, the algorithm chooses the extended candidate cycle whose variance, mean and redundancy satisfy the conditions as the final candidate cycle of the current round, which can guarantee the quality of the extended cycle and limit the number of P-Cycle cycles that complete the protection; When the values of unprotected-links(UPL), the redundancy, mean and the parameter n satisfy the stop condition, the cycle expansion is stopped, so that the number of cycles and the cycle length can be effectively balanced. In the simulation process, the ERPA algorithm is simulated by using the COST293 European Optical Network (EON) topology model, and the performance under different n values is compared and analyzed. The simulation results show that ERPA algorithm needs fewer cycles, has higher protection capacity efficiency and lower total time consumption under the same resource and work capacity, which makes the proposed algorithm more feasible and effective.\",\"PeriodicalId\":381981,\"journal\":{\"name\":\"2019 IEEE 4th Optoelectronics Global Conference (OGC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 4th Optoelectronics Global Conference (OGC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/OGC.2019.8925238\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 4th Optoelectronics Global Conference (OGC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OGC.2019.8925238","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
p周期保护技术是光网络保护中的一项重要技术。本文提出了一种新的基于扩展循环约束的p循环构造算法ERPA (Extended cycle Restriction Based P-Cycle construction algorithm),该算法基于所有候选循环上无保护工作容量的方差、均值和冗余。在循环展开过程中,算法选择方差、均值和冗余满足条件的扩展候选循环作为本轮的最终候选循环,既保证了扩展周期的质量,又限制了完成保护的P-Cycle循环的数量;当UPL (unprotected-links)、冗余、平均值和参数n满足停止条件时,停止循环扩展,使循环数和周期长度得到有效平衡。在仿真过程中,采用COST293欧洲光网络(EON)拓扑模型对ERPA算法进行了仿真,并对不同n值下的性能进行了比较分析。仿真结果表明,在相同的资源和工作容量下,ERPA算法所需的周期更少,具有更高的保护容量效率和更低的总耗时,使所提算法更加可行和有效。
Study of Extended Cycle Restriction Based P-Cycle Construction Algorithm
P-Cycle protection technology is an important technology in optical network protection. This paper proposes a new P-Cycle construction algorithm ERPA (Extended cycle Restriction Based P-Cycle Construction Algorithm), which is based on the variance, mean and redundancy of unprotected working capacity on all candidate cycles. In the process of cycle expansion, the algorithm chooses the extended candidate cycle whose variance, mean and redundancy satisfy the conditions as the final candidate cycle of the current round, which can guarantee the quality of the extended cycle and limit the number of P-Cycle cycles that complete the protection; When the values of unprotected-links(UPL), the redundancy, mean and the parameter n satisfy the stop condition, the cycle expansion is stopped, so that the number of cycles and the cycle length can be effectively balanced. In the simulation process, the ERPA algorithm is simulated by using the COST293 European Optical Network (EON) topology model, and the performance under different n values is compared and analyzed. The simulation results show that ERPA algorithm needs fewer cycles, has higher protection capacity efficiency and lower total time consumption under the same resource and work capacity, which makes the proposed algorithm more feasible and effective.