Domain-Disjoint Routing Based on Topology Aggregation for Survivable Multi-Domain Optical Networks

In a multi-domain network, domains may be defined based on geography or administrative boundaries. For domains that are constructed based on geographic locations, multiple links within the same domain may fail simultaneously due to geographically localized failure events. For domains that are defined administratively, a domain administrator may not be able to provide link-disjointness for two paths traversing the domain. Thus, in some cases, it may be necessary to find two domain-disjoint paths to improve survivability. In this paper, we propose an algorithm to find domain-disjoint working and backup paths for multi-domain routing requests. We prove that our approach is optimal in finding domain disjoint paths with minimum total cost.