Greedy computation of all-optical monitoring trails to minimize total monitoring cost

• Published in: Optical switching and networking Vol. 32; pp. 1 - 13
• Main Authors: Ogino, Nagao, Kitahara, Takeshi
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.04.2019
• Subjects: All-optical mesh networks; Boolean network tomography; Greedy route computation; Length control of monitoring trails; Minimization of monitoring cost; Boolean network tomography; Length control of monitoring trails; All-optical mesh networks; Greedy route computation; Minimization of monitoring cost
• ISSN: 1573-4277; 1872-9770
• DOI: 10.1016/j.osn.2018.11.003

Boolean network tomography can limit optical nodes on which electronic monitors need to be placed in all-optical mesh networks. However, required monitoring cost for operation and deployment increases as the number of optical nodes equipped with the electronic monitors decreases. The required monitoring cost depends heavily on the length of configured all-optical monitoring trails. Two heuristic approaches have been proposed to compute monitoring trails for localizing multiple-link failures. However, these existing approaches cannot control the length of computed monitoring trails in the given monitor placement. This paper proposes a novel approach to minimize the required monitoring cost in the given monitor placement. The proposed approach exploits a greedy method where the routes for the monitoring trails are extended in a hop-by-hop manner to localize all link failures in arbitrary failure scenarios. The greedy method can control the length of monitoring trails flexibly due to the hop-by-hop extension of monitoring trails. The simulation results confirm that the proposed approach can minimize the total monitoring cost adaptively by adjusting the length of monitoring trails on the basis of the trade-off relationship between the monitoring operation cost and deployment cost.