TY - GEN
T1 - SRLG failure localization in all-optical networks using monitoring cycles and paths
AU - Ahuja, Satyajeet S.
AU - Ramasubramanian, Srinivasan
AU - Krunz, Marwan
PY - 2008
Y1 - 2008
N2 - 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 is a failure of multiple links due to a failure of a common resource. MCs (MPs) start and end at 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 an 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 with up to k links. For networks that are less than (k + 2)-edge connected, we derive necessary and sufficient condition on the placement of monitoring locations for unique localization of any SRLG failure of up to k links. We use these conditions to develop an algorithm for the placement of 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 single monitoring location. We provide an integer linear program and a heuristic to identify MCs for networks with one monitoring location. Through extensive simulations, we demonstrate the effectiveness of the proposed monitoring technique.
AB - 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 is a failure of multiple links due to a failure of a common resource. MCs (MPs) start and end at 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 an 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 with up to k links. For networks that are less than (k + 2)-edge connected, we derive necessary and sufficient condition on the placement of monitoring locations for unique localization of any SRLG failure of up to k links. We use these conditions to develop an algorithm for the placement of 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 single monitoring location. We provide an integer linear program and a heuristic to identify MCs for networks with one monitoring location. Through extensive simulations, we demonstrate the effectiveness of the proposed monitoring technique.
UR - http://www.scopus.com/inward/record.url?scp=51349159765&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51349159765&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2007.45
DO - 10.1109/INFOCOM.2007.45
M3 - Conference contribution
AN - SCOPUS:51349159765
SN - 9781424420261
T3 - Proceedings - IEEE INFOCOM
SP - 700
EP - 708
BT - INFOCOM 2008
T2 - INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications
Y2 - 13 April 2008 through 18 April 2008
ER -