We focus 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 what we believe to be a novel wavelength assignment algorithm based on hop counts and relative capacity loss, called modified distributed relative capacity loss (MDRCL). It consists of grouping end-to-end routes with the same number of hops in MDRCL tables. Unlike the distributed relative capacity loss (DRCL) algorithm, MDRCL offers a new strategy for wavelength assignment, including the destination node in 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 in 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 MDRCL algorithm outperforms the traditional wavelength assignment algorithms.
© 2005 Optical Society of AmericaPDF Article