Monitoring trail allocation for fast link failure localization without electronic alarm dissemination

Monitoring trail (m-trail) provides an efficient way to achieve fast and unambiguous link failure localization in all-optical networks. To remove the electronic alarm dissemination, the original m-trail concept has been extended to allow trail status checking at each on-trail node by tapping the supervisory optical signal. By properly allocating such extended m-trails, each monitoring node can ail-optically localize every link failure using its locally collected optical alarm signals. This not only speeds up failure localization, but also minimizes monitoring resources by sharing supervisory wavelength-links among different monitoring nodes. However, the existing ILP design is very time-consuming and could hardly reach optimality. In this paper, we propose an efficient greedy algorithm to allocate the (extended) m-trails and minimize the total wavelength cost Our heuristic is based on a novel “Min Wavelength Max Information” principle which quantifies the contribution of each m-trail on failure localization, and a set of advanced techniques (such as trail-splitting and trail-sharing, etc) to intelligently allocate m-trails. Simulation results substantially attest the superior efficiency and performance of the algorithm in terms of minimizing the total wavelength cost, the required number of m-trails, and the algorithm running time.