On Monitoring Transparent Optical Networks
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
Single-link failure detection in all-optical networks using monitoring cycles and paths
IEEE/ACM Transactions on Networking (TON)
Optimal solutions for single fault localization in two dimensional lattice networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Active monitoring and alarm management for fault localization in transparent all-optical networks
IEEE Transactions on Network and Service Management
Optical Layer Monitoring Schemes for Fast Link Failure Localization in All-Optical Networks
IEEE Communications Surveys & Tutorials
On a new class of codes for identifying vertices in graphs
IEEE Transactions on Information Theory
Resilience in multilayer networks
IEEE Communications Magazine
Management and control of transparent optical networks
IEEE Journal on Selected Areas in Communications
Failure Location Algorithm for Transparent Optical Networks
IEEE Journal on Selected Areas in 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
Knight's tour-based fast fault localization mechanism in mesh optical communication networks
Photonic Network Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Achieving fast and precise failure localization has long been a highly desired feature in all-optical mesh networks. Monitoring trail (m-trail) has been proposed as the most general monitoring structure for achieving unambiguous failure localization (UFL) of any single link failure while effectively reducing the amount of alarm signals flooding the networks. However, it is critical to come up with a fast and intelligent m-trail design approach for minimizing the number of m-trails and the total bandwidth consumed, which ubiquitously determines the length of the alarm code and bandwidth overhead for the m-trail deployment, respectively. In this paper, the m-trail design problem is investigated. To gain a deeper understanding of the problem, we first conduct a bound analysis on the minimum length of alarm code of each link required for UFL on the most sparse (i.e., ring) and dense (i.e., fully meshed) topologies. Then, a novel algorithm based on random code assignment (RCA) and random code swapping (RCS) is developed for solving the m-trail design problem. The algorithm is verified by comparison to an integer linear program (ILP) approach, and the results demonstrate its superiority in minimizing the fault management cost and bandwidth consumption while achieving significant reduction in computation time. To investigate the impact of topology diversity, extensive simulation is conducted on thousands of random network topologies with systematically increased network density.