Dynamic routing for shared path protection in multidomain optical mesh networks

Abstract

The routing problem for shared path protection in multidomain optical mesh networks is more difficult than that in single-domain mesh networks due to the lack of complete and global knowledge of the network topology and bandwidth allocation. To overcome this difficulty, we propose an aggregated network modeling by underestimation with a two-step routing strategy. In the first step, a rough routing solution is sketched in a virtual network that is the topology aggregation of the multidomain network. A complete routing is then determined by solving routing problems within the original single-domain networks. The first step can be solved by either using an exact mathematical program or a heuristic, whereas the second step is always solved by heuristics. Computational results show the relevance of the aggregated network modeling. They also prove the scalability of the proposed routing for multidomain networks and its efficiency in comparison with the optimal solution obtained by use of the complete information scenario. In addition, we believe that short working paths lead to a higher possibility of sharing backup resources between backup paths. Our mathematical program model minimizes the total requested resources and at the same time provides a short working path, resulting in a further overall saving of resources.

Efficient Routing Mechanism Using Cycle Based Network and K-Hop Security in Ad-Hoc Networks

“…The dashed line in the cyclic structure of domain dj will be removed according to constraint (1) before computing the second shortest path [6] . The direction of link (BN 2 j; BN 3 j) is set to be from node BN 2 j to node BN 3 j according to constraint (2).We can see that, after the above operations and before computing the second shortest path, the second shortest path cannot traverse domain dj without traversing intradomain link (BN 3 j; BN 1 j) first. In this case, neither of the two shortest paths [7] in the final result traverses link (BN 1 j; BN 3 j).…”

“…The final two shortest paths will be generated after removing the overlapping links. However, Suurballe's algorithm cannot be applied to find a pair of domain-disjoint paths with minimum total cost in the aggregated multi-domain topology [2] , since Suurballe's algorithm allows two paths to traverse the same domain as long as the two paths traverse different links within the domain. Moreover, to the best of our knowledge, there are no existing algorithms for finding minimum-cost domaindisjoint paths.…”

A survey of survivability in multi-domain optical networks

“…In reference [3], the authors propose Extended Shared Path Protection (ESPP) intended for multi-domain networks. In shared path protection, the spare resources can be shared among different backup light-paths as long as those light-paths do not fail simultaneously [16].…”

Graph Partitioning for Survivability in Multi-Domain Optical Networks

“…As mentioned earlier in the introduction, to address these scalability challenges, several multi-domain protection solutions have been studied, i.e., [7], [8], [9], [10], [12]. However, these primarily rely upon topology aggregation techniques to help reduce the amount of routing information exchanged between domains.…”