Spanning-tree based monitoring-cycle construction for fault detection and localization in mesh AONs

We previously showed the feasibility of a fault detection scheme for all-optical networks (AONs) based on decomposing networks into monitoring-cycles (m-cycles) H. Zeng et al., (2004). In this paper, m-cycle construction for fault detection is formulated as a cycle cover problem with certain constraints. A heuristic spanning-tree based cycle construction algorithm is proposed and applied to four typical networks: NSFNET, ARPA2, SmallNet, and Bellcore. Three metrics: the grade of fault localization, wavelength overhead, and the number of cycles in a cover, are introduced to evaluate the performance of the algorithm. The results show that it achieves nearly optimal performance.