Efficient Modeling of the Routing and Spectrum Allocation Problem for Flexgrid Optical Networks

Abstract

While the problem of Routing and Spectrum Allocation (RSA) has been widely studied, very few studies attempt to solve realistic sized instances. Indeed, the state of the art is always below the standard transport capacity of a fiber link with 384 frequency slots, regardless of what the authors consider, heuristics or exact methods with a few exceptions. In this paper, we are interested in reducing the gap between realistic data sets and testbed instances that are often considered, using exact methods. Even if exact methods may fail to solve in reasonable time very large instances, they can, however, output solutions 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 lightpaths associated with shortest paths or k-shortest paths with a small k. We propose an original efficient large-scale optimization model and decomposition algorithm to solve the RSA problem for flexgrid optical networks. It allows the exact or near optimal solution of much larger instances than in the literature.