Skip to Main Content
Routing and wavelength assignment problem in wavelength division multiplexed optical network is represented as an integer linear program which is found to be NP-complete. Our attention is devoted to such networks operating under wavelength continuity constraint, in which a lightpath must occupy the same wavelength on all the links it traverses. In setting up a lightpath, a route must be selected and a wavelength must be assigned to the lightpath. We have proposed ILP formulations for MaxRWA and MinRWA problems with a new cost function. The cost function is based on congestion with delay and hop-count is of secondary importance. Genetic algorithms provide an attractive approach to compute sub-optimal solutions for the RWA problem. This paper discusses a genetic algorithm way of solving the RWA problem on standard networks such as ARPANET.