Solving Routing and Wavelength Assignment Problem with Conflict-Driven ASP Solvers.

The Routing and Wavelength Assignment (RWA) problem is an optical networking problem aiming to improve data transmission by eliminating optoelectronic conversions through the network. RWA problem is in the set of NP-complete problems [3] and thus is also an interesting problem form a computational point of view. It can be solved in different flavours, being the Static Lightpath Establishment (SLE) the one we consider here. In this work we present ASP encodings for the problem. Then, we solve them with ASP solvers and we empirically compare them with previous approaches.