Article ID: | iaor2016214 |
Volume: | 66 |
Issue: | 4 |
Start Page Number: | 347 |
End Page Number: | 363 |
Publication Date: | Dec 2015 |
Journal: | Networks |
Authors: | Ali Mohammed L, Ho Pin-Han, Tapolcai Jnos |
Keywords: | networks: path, risk, quality & reliability, graphs, combinatorial optimization, heuristics |
This article explores a recently introduced novel technique called the nested monitoring trail (m‐trail) method in all‐optical mesh networks for failure localization of any shared risk link group (SRLG) with up to d undirected links. The nested m‐trail method decomposes each network topology that is at least d ‐connected into virtual cycles and trails, in which sets of m‐trails that traverse through a common monitoring node (MN) can be obtained. The nested m‐trails are used in the monitoring burst (m‐burst) framework, in which the MN can localize any SRLG failure by inspecting the optical bursts traversing through it. An integer linear program (ILP) and a heuristic are proposed for the network decomposition, which are further verified by numerical experiments. We show that the proposed method significantly reduces the required fault localization latency compared with the existing methods. Finally, we demonstrate that nested m‐trails can also be used in adaptive probing to find SRLG faults in all‐optical networks. The nested m‐trail based probing method needs a significantly reduced number of sequential probes. Thus, the method overcomes one of the important hurdles to deploy adaptive probing in all‐optical networks: the large number of sequential probes needed to localize SRLG faults.