A Genetic Algorithm for Finding Minimal Wavelength on WDM Ring

Abstract

We consider the routing and wavelength assignment (RWA) problem on WDM ring networks without wave- length conversion. When the physical network and re- quired connections are given, RWA is the problem to select a suitable path and wavelength among the many possible choices for each connection such that not any paths using the same wavelength pass through the same link. This problem has been proven to be the NP-hard problem. In the paper, a genetic algorithm (GA) is proposed to solve it. Experimental results indicate that GA is robust for this problem.