Efficient Heuristic Algorithms for Routing and Wavelength Assignment in Optical WDM Networks

Abstract

The paper presents two heuristic Routing and Wavelength Assignment (RWA) algorithms named Least Count First (LCF) and Least Recently Used First (LRUF) for light-path routing in optical WDM networks under dynamic traffic conditions to meet wavelength continuity constraint. The performance analysis of these two algorithms has been simulated to compare the findings with the existing Fixed Order (FO) algorithm. The analysis reports a significant improvement for the proposed algorithms over the FO algorithm in terms of connection requests handling capability, as the former needs less wavelength scans to satisfy a connection request.