This paper presents heuristic algorithms that may be used for light-path routing and wavelength assignment in optical WDM networks under dynamically varying traffic conditions. We consider both the situations where the wavelength continuity constraint is enforced or not enforced along a light-path. The performance of these algorithms has been studied through simulations. We also compare their performance with that of a simpler system that uses fixed shortest-path routing. Our proposed algorithms provide lower blocking probabilities and are simple enough to be applied for real time network control and management. The heuristic algorithms are computationally simple and efficient to implement and provide good wavelength utilization leading to efficient usage of the network's resources.
ASJC Scopus subject areas
- Computer Networks and Communications