Abstract

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 Optical Society of America

Full Article  |  PDF Article
OSA Recommended Articles
Preserving Confidentiality in PCE-based Multi-domain Networks

Francesco Paolucci, Molka Gharbaoui, Alessio Giorgetti, Filippo Cugini, Barbara Martini, Luca Valcarenghi, and Piero Castoldi
J. Opt. Commun. Netw. 3(5) 465-474 (2011)

Survivable Inter-Domain Routing Based on Topology Aggregation With Intra-Domain Disjointness Information in Multi-Domain Optical Networks

Chengyi Gao, Hakki C. Cankaya, and Jason P. Jue
J. Opt. Commun. Netw. 6(7) 619-628 (2014)

Enhanced Backwards Recursive Path Computation for Multi-area Wavelength Switched Optical Networks Under Wavelength Continuity Constraint

Ramon Casellas, Ricardo Martínez, Raül Muñoz, and Sebastian Gunreben
J. Opt. Commun. Netw. 1(2) A180-A193 (2009)

References

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Figures (12)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Tables (1)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Equations (6)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription