We present an integer linear program based algorithm and a K shortest path based heuristic algorithm for solving the routing and wavelength assignment problem in all optical networks with limited wavelength conversion. These algorithms are executed on a random mesh National Science Foundation Network (NSFNET). Their performances are compared.
['M. D. Swaminathan', 'Kumar N. Sivarajan']
Practical routing and wavelength assignment algorithms for all optical networks with limited wavelength conversion