Handbook of Optimization in TelecommunicationsM.G.C. Resende and P.M. Pardalos (Editors)
Springer Science + Business Media, 2006.
ILP formulations for the routing and wavelength assignment problem: Symmetric systems
|B. Jaumard, C. Meyer, and B. Thiongane|
linear programming (ILP) formulations have been proposed for the routing and
wavelength assignment problem in WDM optical networks, mainly for
asymmetrical systems, more than for symmetrical systems, under different objectives. We
propose a synthesis of the mathematical models for symmetrical systems, with a unified and
simplified notation for four widely used objectives. As for asymmetrical traffic models
(Jaumard, Meyer, and Thiongane, 2004), we show that all formulations, both link and path
formulations, are equivalent in terms of the upper bound value provided by the
optimal solution of their linear programming relaxation, although their number of variables
and constraints differ. We propose an experimental comparison of the best linear
relaxation bounds with the optimal ILP solutions whenever it is
for several network and traffic instances.
wavelength assignment, RWA problem, mathematical programming
formulation, relaxations, bounds.