Efficient heuristic algorithms for light-path routing and wavelength assignment in WDM networks under dynamically varying loads

This paper presents heuristic algorithms that may be used for light-path ro uting and wavelength assignment in optical WDM networks under dynamically v arying traffic conditions. We consider both the situations where the wavele ngth continuity constraint is enforced or not enforced along a light-path. The performance of these algorithms has been studied through simulations. W e also compare their performance with that of a simpler system that uses fi xed shortest-path routing. Our proposed algorithms provide lower blocking p robabilities and are simple enough to be applied for real time network cont rol and management. The heuristic algorithms are computationally simple and efficient to implement and provide good wavelength utilisation leading to efficient usage of the network's resources. (C) 2001 Elsevier Science B.V. All rights reserved.