On the joint routing and wavelength planning in WDM networks

In this paper, we tackle the joint routing and wavelength planning in wavelength division multiplexing (WDM) networks. This problem consists to find the number of wavelengths on each link and the routing metrics that ensure the routing of all virtual wavelength paths (VWPs) and the successful rerouting of the reliable VWPs for all failure scenarios of interest to the network planner. The objective is to minimize the wavelength utilization cost. An optimization model is proposed as well as a tabu-search heuristic algorithm to obtain quasi-optimal solutions for real-size instances of the problem in a reasonable amount of time. Numerical results are presented and the quality of the solutions is calculated using a proposed lower bound. The results illustrate that quasi-optimal solutions can be found using the proposed tabu-based heuristic.