Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
IBM Journal of Research and Development
Filtering Algorithms for the NValue Constraint
Constraints
On column generation formulations for the RWA problem
Discrete Applied Mathematics
A hybrid constraint model for the routing and wavelength assignment problem
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Symmetry and search in a network design problem
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Review: Comparison of ILP formulations for the RWA problem
Optical Switching and Networking
IEEE Journal on Selected Areas in Communications
A hybrid constraint model for the routing and wavelength assignment problem
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Hi-index | 0.00 |
In this paper we present a hybrid model for the static design variant of the routing and wavelength assignment problem in directed networks, an important benchmark problem in optical network design. Our solution uses a decomposition into a MIP model for the routing aspect, combined with a graph coloring step modelled using either MIP (Coin-OR), SAT (minisat) or finite domain constraints (ECLiPSe). We consider two possible objective functions, one minimizing the maximal number of frequencies used on any of the links, the other minimizing the total number of frequencies used. We compare the models on a set of benchmark tests, results show that the constraint model is much more scalable than the alternatives considered, and is the only one producing proven optimal or near optimal results when minimizing the total number of wavelengths.