SRLG Failure Localization in Optical Networks

We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An SRLG failure causes multiple links to break simultaneously due to the failure of a common resource. MCs (MPs) start and end at the same (distinct) monitoring location(s). They are constructed such that any SRLG failure results in the failure of a unique combination of paths and cycles. We derive necessary and sufficient conditions on the set of MCs and MPs needed for localizing any single SRLG failure in an arbitrary graph. When a single monitoring location is employed, we show that a network must be (k+2)-edge connected for localizing all SRLG failures, each involving up to k links. For networks that are less than (k+2)-edge connected, we derive necessary and sufficient conditions on the placement of monitoring locations for unique localization of any single SRLG failure of up to k links. We use these conditions to develop an algorithm for determining monitoring locations. We show a graph transformation technique that converts the problem of identifying MCs and MPs with multiple monitoring locations to a problem of identifying MCs with a single monitoring location. We provide an integer linear program and a heuristic to identify MCs for networks with one monitoring location. We then consider the monitoring problem for networks with no dedicated bandwidth for monitoring purposes. For such networks, we use passive probing of lightpaths by employing optical splitters at various intermediate nodes. Through an integer linear programming formulation, we identify the minimum number of optical splitters that are required to monitor all SRLG failures in the network. Extensive simulations are used to demonstrate the effectiveness of the proposed monitoring technique.

[1]  Yonggang Wen,et al.  Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[2]  Pin-Han Ho,et al.  On Monitoring and Failure Localization in Mesh All-Optical Networks , 2009, IEEE INFOCOM 2009.

[3]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[4]  Zvi Galil,et al.  Maintaining the 3-Edge-Connected Components of a Graph On-Line , 1993, SIAM J. Comput..

[5]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[6]  Byrav Ramamurthy,et al.  Survivable virtual topology routing under shared risk link groups in WDM networks , 2004, First International Conference on Broadband Networks.

[7]  Bin Wu,et al.  Monitoring Trail: On Fast Link Failure Localization in All-Optical WDM Mesh Networks , 2009, Journal of Lightwave Technology.

[8]  Marwan Krunz,et al.  Single-Link Failure Detection in All-Optical Networks Using Monitoring Cycles and Paths , 2009, IEEE/ACM Transactions on Networking.

[9]  Sudhir S. Dixit,et al.  A hybrid distributed fault-management protocol for combating single-fiber failures in mesh-based DWDM optical networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[10]  Haruhiko Ichino,et al.  Optical path fault management in layered networks , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[11]  Yonggang Wen,et al.  Efficient fault-diagnosis algorithms for all-optical WDM networks with probabilistic link failures , 2005, Journal of Lightwave Technology.

[12]  S. Lane.  A structural characterization of planar combinatorial graphs , 1937 .

[13]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[14]  Pin-Han Ho,et al.  Monitoring Cycle Design for Fast Link Failure Localization in All-Optical Networks , 2009, Journal of Lightwave Technology.

[15]  Wu-chi Feng,et al.  Achieving faster failure detection in OSPF networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..