Abstract: We consider the problem of finding end-to-end shortest disjoint paths for a given sequence of domains in multi-domain networks. A Path Computation Element (PCE) serves as a computing entity in each domain, specializing in path computation and optimization. We propose a novel PCE-based scheme that computes the shortest path over multiple domains in the forward direction and computes the disjoint path in the backward direction. The proposed scheme has linear-time computation and message overhead in regard to the number of border nodes. Simulation...
(read more)
Topics: 
Algorithm
Theoretical computer science
Distributed computing