RWA problem with geodesics in realistic OTN topologies
This paper presents a decomposition approach for solving a variant of the routing and wavelength assignment (rwa) problem, in which all connection requests are covered by geodesics, i.e., shortest paths with respect to the number of hops. Our decomposition approach is an extension of a recent method proposed by Simonis (2011). We also improve this method by proposing new ways of selecting the set of promising paths in the paths? selection phase. Our approach as well as an integer linear optimization formulation are tested on 29 realistic optical transport networks. The results show that our approach can find the optimal number of wavelengths or an interval on this number in a short computing time. We also show that this interval can be used to accelerate the solution process of the integer linear formulation. Using these techniques, we were able to find the optimal number of wavelengths for 28 of the 29 networks while providing a small interval on the optimal number of wavelengths for the remaining network.
geodesics decomposition shortest paths optical transport networks integer linear programming constraint programming rwa rwa