A Heuristic Detection/Protection Algorithm on DWDM Layers

In this paper we propose a heuristics for the failure detection/protection in optical networks. We shall utilize the algorithms of Eulerian graph, the minimum perfect matching algorithm and the Dijstra shortest-path algorithms. Our performance evaluation and comparison shows that our algorithm is the simplest among all heuristic algorithms to provide a cycle cover for both detection and full-protection