An algorithm for finding optimal node-disjoint paths in optical switched networks

This paper presents a new exact algorithm for finding two node-disjoint paths of minimum total weight in optical switched networks with wavelength-continuity constraint. Unlike previous heuristic algorithms developed for this purpose, our algorithm is not based on the Suurballe algorithm. Instead, it is based on Dijkstra algorithm modified to work on a dual path. We show that our algorithm can find optimal node-disjoint paths in much smaller time than using an exact ILP algorithm. The performance of the proposed algorithm is demonstrated by simulation results.