We propose an optimal scheme for finding end-to-end shortest disjoint paths with a given sequence of domains in path computation element-based multi-domain networks. We compute the shortest path over multiple domains in the forward direction and compute the disjoint path in the backward direction. The scheme has lower time and message complexity compared to contemporary schemes for finding optimal survivable paths across domains. We prove the optimality of the proposed scheme. To further simplify the implementations in practical scenarios, we also provide heuristic algorithms. Simulation results exhibit superior performance of the proposed optimal and heuristic algorithms compared to existing approaches.
© 2012 OSA
Original Manuscript: November 22, 2011
Revised Manuscript: April 19, 2012
Manuscript Accepted: April 19, 2012
Published: May 14, 2012
Qiong Zhang, Mohammad M. Hasan, Xi Wang, Paparao Palacharla, and Motoyoshi Sekiya, "Survivable Path Computation in PCE-Based Multi-domain Networks," J. Opt. Commun. Netw. 4, 457-467 (2012)