This work focuses on the study of wavelength assignment algorithms based on Graph Coloring techniques. We analyze the performance of the Greedy heuristic, a well-known Graph Coloring heuristic, as well as the Degree of Saturation (DSATUR) and the Recursive Largest First (RLF) heuristics, for planning optical networks. These last two heuristics, to the best of our knowledge, have not yet been applied in the context of optical networks. Extensive simulations have been performed, using real network topologies under a static traffic scenario and we have concluded that the DSATUR and RLF heuristics can outperform the Greedy heuristic in network scenarios where there are several network clusters interconnected by only one or two links. In these cases, the RLF and DSATUR heuristics can provide less 9 and 5 wavelengths, respectively, than the Greedy heuristic, in networks with 34 nodes.

This work was supported under the project of Instituto de Telecomunicações UIDB/EEA/50008/2020

DSATUR,Graph coloring,Greedy,Optical networks,RLF,Wavelength assignment

• Engenharia Eletrotécnica, Eletrónica e Informática - Engenharia e Tecnologia