Sequential Diagnosability is Co-NP Complete
IEEE Transactions on Computers
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
Monitoring Cycles for Fault Detection in Meshed All-Optical Networks
ICPPW '04 Proceedings of the 2004 International Conference on Parallel Processing Workshops
Graph Theory With Applications
Graph Theory With Applications
Optimal solutions for single fault localization in two dimensional lattice networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
M2-CYCLE: An optical layer algorithm for fast link failure detection in all-optical mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A novel approach for failure localization in all-optical mesh networks
IEEE/ACM Transactions on Networking (TON)
Adjacent link failure localization with monitoring trails in all-optical mesh networks
IEEE/ACM Transactions on Networking (TON)
SRLG failure localization in optical networks
IEEE/ACM Transactions on Networking (TON)
Adaptive Fault Monitoring in All-Optical Networks Utilizing Real-Time Data Traffic
Journal of Network and Systems Management
Knight's tour-based fast fault localization mechanism in mesh optical communication networks
Photonic Network Communications
On identifying additive link metrics using linearly independent cycles and paths
IEEE/ACM Transactions on Networking (TON)
Network-wide local unambiguous failure localization (NWL-UFL) via monitoring trails
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 |
In this paper, we consider the problem of fault localization in all-optical networks. We introduce the concept of monitoring cycles (MCs) and monitoring paths (MPs) for unique identification of single-link failures. MCs and MPs are required to pass through one or more monitoring locations. They are constructed such that any single-link failure results in the failure of a unique combination of MCs and MPs that pass through the monitoring location(s). For a network with only one monitoring location, we prove that three-edge connectivity is a necessary and sufficient condition for constructing MCs that uniquely identify any single-link failure in the network. For this case, we formulate the problem of constructing MCs as an integer linear program (ILP). We also develop heuristic approaches for constructing MCs in the presence of one or more monitoring locations. For an arbitrary network (not necessarily three-edge connected), we describe a fault localization technique that uses both MPs and MCs and that employs multiple monitoring locations. We also provide a linear-time algorithm to compute the minimum number of required monitoring locations. Through extensive simulations, we demonstrate the effectiveness of the proposed monitoring technique.