| Summary: | The Routing and Spectrum Assignment (RSA) problem is NP-Hard so searching the entire problem space is not applicable. Many decomposition algorithms rely on reducing the search space in the routing space and applying heuristics algorithm in the spectrum assignment sub-problem. This is not necessarily a right solution as the ignored routing tables may lead to a better solution when they are used later as input to the Spectrum Assignment sub-problem. In this paper, we develop a new recursive decomposition approach for the RSA problem in optical networks. At the core of our approach is a new recursive branch and-bound procedure for carrying out an exhaustive search of the routing space in a scalable manner. This recursion effectively decouples the routing from the spectrum assignment part of the problem. Sequential generation of the full set of routing tables requires huge memory and very large processing time. Alternatively, our approach deploys multi-core architectures to generate the routing tables in parallel using OpenMP. Experimental results indicate that our recursive algorithm is quite efficient in searching the entire routing space for topologies representing large-scale wide area networks. Importantly, the decomposition may be more generally applied to any network design problem whose solution involves a search over both a routing and a resource allocation space. The main contributions for this paper are that we are able to generate all the search space in parallel in less than 1 min for 32-nodes network. Secondly, we are able to investigate all the routing tables, eliminate most of the search space, and select the promising routing tables that are proven to lead to a better solution in the Spectrum Assignment Sub-Problem
|
|---|
