Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment with power considerations in optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Optical networks: a practical perspective
Optical networks: a practical perspective
Routing and wavelength assignment in optical networks
IEEE/ACM Transactions on Networking (TON)
Optical WDM Networks (Optical Networks)
Optical WDM Networks (Optical Networks)
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Optimal routing and wavelength assignment in WDM ring networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
On column generation formulations for the RWA problem
Discrete Applied Mathematics
Hierarchical optimization procedure for traffic grooming in WDM optical networks
ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
An OBS RWA formulation for asynchronous loss-less transfer in OBS networks
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
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
Solving the static design routing and wavelength assignment problem
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Variable neighborhood descent with iterated local search for routing and wavelength assignment
Computers and Operations Research
An efficient column generation design method of p-cycle-based protected working capacity envelope
Photonic Network Communications
| Hi-index | 0.00 |
We present a review of the integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networks assuming asymmetrical traffic. We show that all formulations proposed under asymmetrical traffic assumptions, 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 widely differ. We propose improvements for some of the formulations that result in further reductions in the number of variables and constraints. Under the objective of minimizing the blocking rate, we propose an experimental comparison of the best lower and upper bounds that are available. We then discuss the easiness of exact ILP solution depending on the formulations. We observe that LP relaxation bounds often provide solutions with a value very close to the optimal ILP one. We solve exactly for the first time several RWA (Routing and Wavelength Assignment) realistic instances, including those proposed by Krishnaswamy and Sivarajan [R. Krishnaswamy, K. Sivarajan, Algorithms for routing and wavelength assignment based on solutions of LP-relaxation, IEEE Communications Letters 5 (10) (2001) 435-437], with a proof of the optimality.