Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Maintaining the 3-edge-connected components of a graph on-line
SIAM Journal on Computing
Introduction to algorithms
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Survivable Virtual Topology Routing under Shared Risk Link Groups in WDM Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Single-link failure detection in all-optical networks using monitoring cycles and paths
IEEE/ACM Transactions on Networking (TON)
Localizing link failures in all-optical networks using monitoring tours
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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 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.