Genetic algorithm based dynamic combination of polyhedron structures against multiple link failures

doi:10.19682/j.cnki.1005-8885.2022.1021

中国邮电高校学报(英文) ›› 2022, Vol. 29 ›› Issue (6): 30-35.doi: 10.19682/j.cnki.1005-8885.2022.1021

• Special Topic: Optical Communication and Artificial Intelligence • 上一篇下一篇

Genetic algorithm based dynamic combination of polyhedron structures against multiple link failures

Liu Yu, Li Xin, Huang Shanguo

School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China

收稿日期:2022-07-21 修回日期:2022-10-17 出版日期:2022-12-30 发布日期:2022-12-30
通讯作者: Li Xin E-mail:xinli@bupt.edu.cn
基金资助:
This work was supported in part by the National Natural Science Foundation of China (62171050).

Genetic algorithm based dynamic combination of polyhedron structures against multiple link failures

Liu Yu, Li Xin, Huang Shanguo

School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China

Received:2022-07-21 Revised:2022-10-17 Online:2022-12-30 Published:2022-12-30
Contact: Li Xin E-mail:xinli@bupt.edu.cn
Supported by:
This work was supported in part by the National Natural Science Foundation of China (62171050).

摘要/Abstract

摘要：

Polyhedron protection realizes link protection by constructing a pre-assigned structure and allocates backup resources on a fixed polyhedron structure based on the maximum number of working resources. Taking into account both protection success rate and resource redundancy, this paper dynamically combines different polyhedron structures to allocate backup resources according to the link load, and proposes a genetic algorithm based dynamic combination of polyhedron structures (GA-DCPS) to reduce the resource consumption in the network while ensuring the protection success rate. GA-DCPS aims to minimize the consumption of wavelength resources, and uses the genetic strategy to find the polyhedron combination with the least redundancy to allocate backup resources while ensuring the success rate of service protection. Compared to using the fixed polyhedron structure with 1:m backup resource allocation, GA-DCPS can reduce resource redundancy by about 15% while ensuring complete protection against double-link failures.

关键词:

optical networks, multiple link failures, polyhedron protection, resource redundancy

Abstract: Polyhedron protection realizes link protection by constructing a pre-assigned structure and allocates backup resources on a fixed polyhedron structure based on the maximum number of working resources. Taking into account both protection success rate and resource redundancy, this paper dynamically combines different polyhedron structures to allocate backup resources according to the link load, and proposes a genetic algorithm based dynamic combination of polyhedron structures (GA-DCPS) to reduce the resource consumption in the network while ensuring the protection success rate. GA-DCPS aims to minimize the consumption of wavelength resources, and uses the genetic strategy to find the polyhedron combination with the least redundancy to allocate backup resources while ensuring the success rate of service protection. Compared to using the fixed polyhedron structure with 1:m backup resource allocation, GA-DCPS can reduce resource redundancy by about 15% while ensuring complete protection against double-link failures.

Key words: optical networks, multiple link failures, polyhedron protection, resource redundancy

中图分类号:

TN913
TN915

Liu Yu, Li Xin, Huang Shanguo. Genetic algorithm based dynamic combination of polyhedron structures against multiple link failures[J]. The Journal of China Universities of Posts and Telecommunications, 2022, 29(6): 30-35.

参考文献

1. LU P, ZHANG L, LIU X H, et al. Highly efficient data migration and backup for big data applications in elastic optical inter-datacenter networks. IEEE Network, 2015, 29(5): 36-42

2. YIN S, HUANG S G, GUO B L, et al. Shared-protection survivable multipath scheme in flexible-grid optical networks against multiple failures. Journal of Lightwave Technology, 2017, 35(2): 201-211

3. MUKHERJEE B. Optical WDM Networks. Berlin, Germany: Springer, 2006

4. GUO B L, HUANG S G, LUO P, et al. Dynamic survivable mapping in IP over WDM network. Journal of Lightwave Technology, 2011, 29(9): 1274-1284

5. RUAN L, XIAO X. Survivable multipath routing and spectrum allocation in OFDM-based flexible optical networks. Journal of Optical Communications and Networking, 2013, 5(3): 172-182

6. RUAN L, ZHENG Y W. Dynamic survivable multipath routing and spectrum allocation in OFDM-Based flexible optical networks. Journal of Optical Communications and Networking, 2014, 6(1): 77-85

7. HUANG S G, MARTEL C, MUKHERJEE B. Survivable multipath provisioning with differential delay constraint in telecom mesh networks. IEEE/ACM Transactions on Networking, 2011, 19(3): 657-669

8. PAN M L, QIU Y, ZHANG C W. Multiple leaf-ringing based protection algorithm with spectrum defragmentation for multicast traffic in elastic optical network. Optical Fiber Technology, 2020, 61: Article 102418

9. SONG Z R, JI W, YIN R, et al. Highly reliable metro-access network based on a dual-fiber ring architecture and optimized protection mechanisms. IEEE Access, 2021, 9: 136419-136437

10. GUPTA V, ASTHANA, R, SINGH Y N. p-cycle protection without wavelength converters in wavelength division multiplexing. Proceedings of the 2020 International Conference on Inventive Computation Technologies (ICICT’20), 2020, Feb 26-28, Coimbatore, India. Piscataway, NJ, USA: IEEE, 2020: 1036-1041

11. ZHANG W, ZHANG J, LI X. Theoretical analysis of preconfigured k-edge-connected structures in flexible bandwidth optical networks. Optical Engineering, 2016, 55(6): Article 066105

12. LI X, HUANG S G, ZHANG J, et al. Analysis and modeling of k-regular and k-connected protection structure in ultra-high capacity optical networks. China Communications, 2015, 12(3): 106-119

13. ONGUETOU D P, GROVER W D. A two-hop segment protecting paradigm that unifies node and span failure recovery under p-cycles. IEEE Communications Letters, 2010, 14(11): 1080-1082

14. MA C, ZHANG J, ZHAO Y L, et al. Pre-configured polyhedron (p-Poly) with optimal protection efficiency for dual-link failure in optical mesh networks. Proceedings of the 6th International Workshop on Reliable Networks Design and Modeling (RNDM’14), 2014, Nov 17-19, Barcelona, Spain. Piscataway, NJ, USA: IEEE, 2014: 16-22

15. HUANG S G, GUO B L, LI X, et al. Pre-configured polyhedron based protection against multi-link failures in optical mesh networks. Optics Express. 2014, 22(3): 2386-2402

16. LI X, HUANG S G, ZHANG J, et al. k-regular and k-(edge)-connected protection structures in optical transport networks. Proceedings of the 2013 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference (OFC/NFOEC’13), 2013, Mar 17-21, Anaheim, CA, USA. Piscataway, NJ, USA: IEEE, 2013: 3p

17. MA C, ZHANG J, ZHAO Y L, et al. Pre-configured prism (p-Prism) method against simultaneous dual-link failure in optical networks. Optical Fiber Technology, 2014, 20(5): 443-452

MA C, ZHANG J, ZHAO Y L, et al. Preconfigured ball (p-Ball) protection method with minimum backup links for dual-link failure in optical mesh networks. IEEE Communications Letters, 2015, 19(3): 363-366

Genetic algorithm based dynamic combination of polyhedron structures against multiple link failures

Genetic algorithm based dynamic combination of polyhedron structures against multiple link failures

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 1

编辑推荐

Metrics

本文评价