Survivable Node-Disjoint Routing in Multi-Domain Networks

This paper aims at finding node-disjoint paths in multi-domain networks while avoiding to disclose each domain topology and minimizing routing cost. In order to maintain the privacy of the domains, the proposed solutions exploit a full mesh Topology Aggregation scheme that limits the exchanged information. Each domain provides information only on the existence and total cost of the two shortest node-disjoint paths for every pair of aggregated links. This information is then utilized on the inter-domain aggregated topology for the computation of two node-disjoint paths with minimum cost for every demand in the network. Four approaches are proposed and evaluated in terms of average cost per demand and blocking probability. Their performance is also compared to the respective approaches for link-disjoint routing. Two of the proposed node-disjoint routing schemes keep low blocking probability (with a median of 0–3 %), while incurring 5 % higher cost when compared to link-disjoint routing.