Multi-Failure Localization in High-Degree ROADM-based Optical Networks using Rules-Informed Neural Networks

TL;DR

This paper introduces a novel rules-informed neural network method for accurately localizing multiple failures in high-degree ROADM-based optical networks, significantly improving localization accuracy over baseline algorithms.

Contribution

It is the first study to address multi-failure localization in high-degree ROADM networks using a rules-informed neural network approach.

Findings

Achieves up to 20% higher localization accuracy.

Incur only around 4.14 ms average inference time.

Effectively combines rules-based reasoning with neural networks.

Abstract

To accommodate ever-growing traffic, network operators are actively deploying high-degree reconfigurable optical add/drop multiplexers (ROADMs) to build large-capacity optical networks. High-degree ROADM-based optical networks have multiple parallel fibers between ROADM nodes, requiring the adoption of ROADM nodes with a large number of inter-/intra-node components. However, this large number of inter-/intra-node optical components in high-degree ROADM networks increases the likelihood of multiple failures simultaneously, and calls for novel methods for accurate localization of multiple failed components. To the best of our knowledge, this is the first study investigating the problem of multi-failure localization for high-degree ROADM-based optical networks. To solve this problem, we first provide a description of the failures affecting both inter-/intra-node components, and we consider different deployments of optical power monitors (OPMs) to obtain information (i.e., optical power) to be used for automated multi-failure localization. Then, as our main and original contribution, we propose a novel method based on a rules-informed neural network (RINN) for multi-failure localization, which incorporates the benefits of both rules-based reasoning and artificial neural networks (ANN). Through extensive simulations and experimental demonstrations, we show that our proposed RINN algorithm can achieve up to around 20 higher localization accuracy compared to baseline algorithms, incurring only around 4.14 ms of average inference time.