Novel Wavelength Assignment Algorithm for Intelligent Optical Networks Based on Hops Counts and Relative Capacity Loss

Abstract

This paper focuses on the routing and wavelength assignment (RWA) problem in intelligent and transparent optical networks operating under no wavelength conversion constraint for end-to-end connections in distributed environments. We propose and demonstrate a novel wavelength assignment algorithm based on hops counts and relative capacity loss, called Modified Distributed Relative Capacity Loss (M-DRCL). It consists of grouping end-to-end routes with the same number of hops in M-DRCL tables. Dissimilar to the DRCL algorithm, M-DRCL shows a new strategy of wavelength assignment, including the destination node on its analysis and assuming one, more than one, or even all potential routes from source node to destination nodes combined by the same number of hops on its tables. We present simulation results of dynamic traffic in a hypothetical meshed network in terms of blocking probabilities as a function of network load. We show that our M-DRCL algorithm outperforms the traditional WA algorithms.