We show in this work how the problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, followed by the solution of a partition coloring problem in a conflict graph. A new tabu search heuristic is also proposed for the partition coloring problem, which may be viewed as an extension of the graph coloring problem. Computational experiments are reported, showing that the tabu search heuristic outperforms the best heuristic for partition coloring by approximately 20% and illustrating that the new approach for the problem of routing and wavelength assignment is more robust than a well established heuristic for this problem.
Citation
Research report, Catholic University of Rio de Janeiro, Department of Computer Science, November 2003.
Article
View Routing and wavelength assignment by partition coloring