A heuristic for monitoring tree design

We study the m-tree (monitoring tree) design problem in all-optical WDM (Wavelength Division Multiplexing) mesh networks for achieving fast and unambiguous link failure localization. Although the ILP (Integer Linear Program) model can obtain optimal solutions, it is intractable for solving the m-tree design problem in large-size networks. To solve the m-tree design problem in large size networks, we propose a heuristic MLS (Monitor Location Searching) in this paper. The time complexity of our heuristic is O(|E|+|V|), so it can be easily used in large size networks. By simulation, we demonstrate that our heuristic can obtain a well solution in large size network. Our heuristic also provides a flexible framework which enables researchers to try multiple possible variations for future study.