Towards an efficient and exact algorithm for dynamic dedicated path protection

Abstract

We present the efficient and optimal algorithm for dynamic routing with dedicated path protection in optical networks; efficient, because it can solve large problems, and optimal, because its results are optimal. The proposed algorithm uses our generic Dijkstra algorithm on a search graph generated "on-the-fly" based on the input graph. We corroborated the optimality of results of the proposed algorithm with the bruteforce enumeration. We present the simulation results of the dedicated-path protection with signal modulation constraints for the elastic optical networks of three sizes: 25, 50 and 100 nodes, and three numbers of spectrum units: 160, 320, and 640. There were in total 16200 simulation runs with about 24 million searches.