Survivable inter-domain routing based on topology aggregation with disjointness information in multi-domain optical networks

Abstract

In a multi-domain network, domains can be defined geographically or administratively. Since only a limited amount of information of each domain is allowed to be broadcasted by domain service providers, Topology Aggregation (TA) is usually adopted. The amount of information provided by each domain may vary based on the service provider. For instance, some domains may provide only a single shortest path between two border nodes, while others may be capable of providing a pair of disjoint paths with minimum total cost. In this case, inter-domain path routing with protection needs to consider and utilize the different levels of information provided by different domains in order to find the best solution. In this paper, we propose two approaches that find a pair of disjoint inter-domain paths with minimum total cost based on a matrix for each domain that includes disjointness information between the aggregated links inside the domain.