Link Fault Localization Using Bi-Directional M-Trails in All-Optical Mesh Networks

Abstract

Abstract-The paper considers the problem of single-link failure localization in all-optical mesh networks. Our study follows a generic monitoring approach using supervisory lightpaths (SLPs), in which a set of bi-directional monitoring trails (bmtrails) are defined and closely monitored, such that the network controller can achieve unambiguous failure localization (UFL) for any single link by collecting the flooded alarms from the affected bm-trails. With a target of minimizing the number of bm-trails (or the length of alarm codes) required for singlelink UFL, the paper provides optimal (or essentially optimal) solutions to the bm-trail allocation problem on a number of well known topologies. First we demonstrate that the theoretical lower bound of log 2 (|E| + 1) bm-trails can be achieved in any 2 · log 2 (|E| + 1) connected graph, where |E| is the number of links. Next, we prove an essentially optimal solution for 1-by-N grid topologies (also known as chocolate bar graphs), where 0.42 + log 2 (|E| + 2) bm-trails can be achieved. Based on the solution for chocolate bars, we further investigate bm-trail solutions to general 2-dimensional (2D) grid topologies, and the developed solution requires no more than 3 + log 2 (|E| + 1) bm-trails for UFL. Such an optimal (or essentially optimal) logarithmic behavior, although has been well observed in general topologies in our previous studies [1], [2], is formalized for the first time in this paper via a suite of polynomial-time deterministic constructions that consume less than a few seconds of running time in topologies of thousands of nodes.

Bidirectional demarcated vector-based bidirectional link failure localization method in optical network

“…Constraint (17) restraints that the total bandwidth in the system must be larger than or equal to the lower bound on the monitoring cost. Constraint (18) indicates that, for each node u, out of all service categories j, the number of times node u is selected as the end point of the service cannot exceed the number of times node u is used as the starting point of the service. (19) For each node u, the total amount of traffic between node u and other nodes in the service category j cannot exceed L. Constraint ( 20) -( 21) converts binary code to the decimal, and constraint ( 22) -( 23) prevent duplicate alarm codes.…”

“…Most of the above methods are used to locate single-link faults, and the following are some methods for bidirectional link and muti-link failure localization. [14][15][16][17] Janos T et al 18 proposed a localization scheme, which used a specific monitoring optical path to deploy a set of bidirectional monitoring paths to collect alarm information and realized rapid single-link failure localization. Elias A.…”

Separating path systems

“…Separating path systems arise naturally in the context of network design (see, for instance, [1,13,21]). We are presented with a communication network with one (and at most one) defective link and our goal is to identify this link.…”

Link fault identification using dependent failure in wireless communication networks

“…Wireless links may congest, not only because of the unbalance of loads or abnormal workloads for the nodes, but also because of equipment faults or environmental impact. Numerous fault management methods [1,2] have been developed for networks. Expert systems have gained wide acceptance as fault management tool.…”