Method and system for fault isolation within a network element in an optical network

• US 7,379,061 B2
• Filed: 11/12/2004
• Issued: 05/27/2008
• Est. Priority Date: 11/12/2003
• Status: Expired due to Fees

• Current Assignee: Alcatel-Lucent Canada Incorporated (Nokia Corporation)
• Original Assignee: Alcatel-Lucent Canada Incorporated (Nokia Corporation)
• Inventors: Castonguay, Arthur Emery, Groves, John Frederick
• Primary Examiner(s): Nguyen; Kimbinh T
• Application Number:
  US10/986,347
• Publication Number:
  US 20050099419A1
• Time in Patent Office: 1,292 Days
• Field of Search: 345/420, 345/440, 345/419, 345/423, 345/428, 345/441
• US Class Current: 345/420
• CPC Class Codes: H04L 41/0631 using root cause analysis; using analysis of correlation between notifications, alarms or events based on decision criteria, e.g. hierarchy, tree or time analysis
• CPC Class Codes: H04L 41/0659 by isolating or reconfiguring faulty entities

Abstract

A method and system for fault isolation within a network element in an optical network is described. A single fault in the system can give rise to multiple alarms detected at multiple points. Finding the root cause alarm corresponding to the fault that has triggered these alarms is important for fault isolation and is the focus of attention for this invention. The network element is modeled by a directed acyclic graph that captures the interactions among various components in the network element. Using a graph-based technique the invention analyzes the various topological faults raised and their locations for identifying root cause alarms and masking all correlated alarms.

Claims

1. A method for fault isolation within a network element (NE) in an optical network, the method comprising:

constructing a directed acyclic graph (DAG) based on the NE topology, the DAG having edges connecting vertices, each vertex representing a physical port direction in the NE;

identifying root cause alarms according to steps of;

finding starting vertices in the DAG;

pruning the edges of the DAG;

pruning the starting vertices of the DAG;

performing a topological sort of the vertices in the DAG; and

performing a topological walk of the DAG; and

masking remaining correlated alarms within the NE.

2. A method as claimed in claim 1, wherein the step of finding starting vertices comprises the steps of:

traversing the DAG starting from vertices with no incoming edges; and

identifying a minimal set of vertices such that each vertex V in the set is associated with a topological fault and any other up-graph vertex that is connected with V, is disassociated with any topological fault.

3. A method as claimed in claim 1, wherein the step of pruning edges comprises the steps of:

traversing the DAG from said starting vertices; and

marking edges that do not lead to vertices that support topological faults as pruned.

4. A method as claimed in claim 1, wherein the step of pruning starting vertices comprises the step of identifying the starting vertices, all outgoing edges of which are pruned and removing them from any further consideration.

5. A method as claimed in claim 1, wherein the step of performing the topological sort comprises the step of producing an ordering of the vertices in the DAG in such a way that all vertices that are up-graph from a vertex V are processed prior to V.

6. A method as claimed in claim 1, wherein the step of performing a topological walk comprises the steps of:

visiting each vertex in the DAG in a topological order;

processing a vertex being currently visited if it has a topological fault associated with it; and

processing neighbours of the vertex being currently visited;

wherein the neighbours of the vertex are the vertices that are reached via a single hop from said vertex.

7. A method as claimed in claim 6, wherein the step of processing the vertex being currently visited comprises the steps of:

generating a new mask vector each element in which corresponds to a topological fault type;

storing the new mask vector into the mask vector for the vertex being processed, if there is a difference between the mask vector and the new mask vector;

updating the nodal masking of faults and adjusting the alarms associated with the condition; and

preparing a topological fault information that will be propagated to the neighbours of the vertex being currently visited.

8. A method as claimed in claim 7, wherein the step of preparing the topological fault information comprises the step of processing a vector each element in which records information regarding topological faults of a particular type.

9. A method as claimed in claim 6, wherein the step of processing the neighbours of the vertex being currently visited comprises the step of propagating the topological fault information from the vertex being currently visited to all neighbours of said vertex.

10. A system for fault isolation within a network element (NE) in an optical network, the system comprising:

means for constructing a directed acyclic graph (DAG) based on the NE topology, the DAG having edges connecting vertices, each vertex representing a physical port direction in the NE;

means for identifying root cause alarms comprising;

means for finding starting vertices in the DAG;

means for pruning the edges of the DAG;

means for pruning the starting vertices of the DAG;

means for performing a topological sort of the vertices in the DAG; and

means for performing a topological walk of the DAG;

means for masking of all remaining correlated alarms within the NE; and

a display unit for displaying said root cause alarms.

11. A system as claimed in claim 10, wherein the means for finding starting vertices comprises:

means for traversing the DAG starting from vertices with no incoming edges; and

means for identifying a minimal set of vertices such that each vertex V in the set is associated with a topological fault and any other up-graph vertex that is connected with V, is disassociated with any topological fault.

12. A system as claimed in claim 10, wherein the means for pruning edges comprises:

means for traversing the DAG from said starting vertices; and

means for marking edges that do not lead to vertices that support topological faults as pruned.

13. A system as claimed in claim 10, wherein the means for pruning starting vertices comprises a means for identifying the starting vertices, all outgoing edges of which are pruned and removing them from any further consideration.

14. A system as claimed in claim 10, wherein the means for performing a topological sort comprises a means for producing an ordering of the vertices in the DAG in such a way that all vertices that are up-graph from a vertex V are processed prior to V.

15. A system as claimed in claim 10, wherein the means for performing a topological walk comprises:

means for visiting each vertex in the DAG in a topological order;

means for processing a vertex being currently visited if it has a topological fault associated with it; and

means for processing neighbours of the vertex being currently visited;

wherein the neighbours of the vertex are the vertices that are reached via a single hop from said vertex.

16. A system as claimed in claim 15, wherein the means for processing the vertex being currently visited comprises:

means for generating a new mask vector each element in which corresponds to a topological fault type;

means for storing the new mask vector into the mask vector for the vertex being processed, if there is a difference between the mask vector and the new mask vector;

means for updating the nodal masking of faults and adjusting associated alarms; and

means for preparing topological fault information that will be propagated to the neighbours of the vertex being currently visited.

17. A system as claimed in claim 16, wherein the means for preparing the topological fault information comprises means for processing a vector each element in which records information regarding topological faults of a particular type.

18. A system as claimed in claim 15, wherein the means for processing the neighbours of the vertex being currently visited comprises means for propagating the topological fault information from the vertex being currently visited to all neighbours of said vertex.

19. A system as claimed in claim 10, wherein the display unit for displaying said root cause alarms comprises a means for displaying the unmasked alarms.

20. A method of fault isolation within a network element (NE) in an optical network, comprising the steps of:

(a) marking optical channel paths in the network element with respective unique signatures in a form of low frequency dither tone modulation;

(b) detecting faults in the NE by analyzing the unique signatures at the physical ports of the network element; and

(c) identifying root cause alarms among a plurality of alarms caused by said detected faults in the NE by analyzing said faults in the NE using directed acyclic graph (DAG) wherein said physical ports represent vertices in the DAG.

21. A method as claimed in claim 20 further comprising the step of displaying said root alarms.

22. A system for fault isolation within a network element (NE) in an optical network, comprising:

(a) an optical signature generator for generating unique signatures and marking optical channel paths in the network element with respective unique signatures in a form of a low frequency dither tone modulation;

(b) an optical signal detector for detecting faults in the NE by analyzing the unique signatures at the physical ports of the NE; and

(c) a processing module comprising a computer program instructions stored in a computer readable memory for identifying root cause alarms among a plurality of alarms caused by said detected faults in the NE by analyzing said faults in the NE using a Directed Acyclic Graph (DAG), wherein said physical ports represent vertices of the DAG.

23. A system as claimed in claim 22, further comprising a display unit for displaying said root alarms.