Performance of wavelength assignment heuristics in a dynamic optical network with adaptive routing and traffic grooming

This paper present the performance analysis of the wavelength assignment four heuristics First-Fit, Random, Least-Used and Most-Used, considering adaptive routing and traffic grooming capabilities in the network. The goal of this comparison is to verify if some of those algorithms present a better performance with relation to First-Fit, considering these capabilities.