By Topic

Survivable path computation in PCE-based multi-domain networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Qiong Zhang ; Fujitsu Labs. of America, Inc., Richardson, TX, USA ; Hasan, M.M. ; Wang, X. ; Palacharla, P.
more authors

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.

Published in:

Optical Communications and Networking, IEEE/OSA Journal of  (Volume:4 ,  Issue: 6 )