A new strategy for dynamic RWA in all-optical WDM networks using delay and congestion constrained optimized RWA heuristic algorithm (DCO)

Abstract

The dynamic routing and wavelength assignment (RWA) problem constitutes a challenge in optical Wavelength Division Multiplexing (WDM) networks. Existing research proposes many algorithms to improve the blocking probability and the channel utilization performance of WDM networks. However, current algorithms are not designed to maintain a good QoS which is a criterion of great important in dynamic RWA networks. This thesis provides an attractive approach for solving the dynamic RWA problem with wavelength continuity constraint, in which the QoS in WDM networks is considered. We introduce a new cost function based on alternate routing scheme along with constrained and weighted route hop distance and congestion. The wavelength assignment follows the first fit (FF) scheme. The delay and congestion constrained optimized (DCO) RWA heuristic algorithm achieves stringent blocking probability and enhanced channel utilization against previous RWA algorithms, while preserving good QoS in terms of packet delay. Extensive simulation results confirm the significant performance improvement of DCO.