Finding protection cycles in DWDM networks

We introduce the problem of mesh optical network protection based on multiple logical ring/cycles. A two-staged problem formulation as well as classical ring finding algorithms are first discussed. A state-of-art protection cycle (p-cycle) finding algorithm is then proposed. This algorithm is scalable and especially suitable for sparse mesh networks. Finally, the performance of the algorithm is gauged by running on some real world network topologies.