Efficient Spectrum Utilization in Large Scale RWA Problems
Abstract: While the routing and wavelength assignment (RWA) has been widely studied, a very few studies attempt to solve realistic size instances, namely, with 100 wavelengths per fiber and a few hundred nodes. Indeed, state of the art is closer to around 20 nodes and 30 wavelengths, regardless of what the authors consider, heuristics or exact methods with a very few exceptions. In this paper, we are interested in reducing the gap between reali realistic stic data sets and test bed instances that are often used, using exact methods. Even if exact methods may fail to solve in reasonable time very large instances, they can, however, output a-solutions a with a very good and proven accuracy. The novelty of this paper is to exploit the observations that optimal solutions contain a very large number of light paths associated with shortest paths or kk-shortest shortest paths with a small k. We propose different RWA algorithms that lead to solve exactly or near exactly much larger l instances than in the literature, i.e., with up to 150 wavelengths and 90 nodes. Extensive numerical experiments are conducted on both the static and dynamic incremental planning RWA problem.