A genetic algorithm for dynamic routing and wavelength assignment in WDM networks

  • Authors:
  • Vinh Trong Le;Son Hong Ngo;Xiaohong Jiang;Susumu Horiguchi;Minyi Guo

  • Affiliations:
  • Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Japan;Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Japan;Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Japan;Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Japan;School of Computer Science and Engineering, The University of Aizu, Japan

  • Venue:
  • ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we study the challenging problem of Dynamic Routing and Wavelength Assignment (DRWA) in WDM (Wavelength-Division-Multiplexing) networks with wavelength continuity constraint, and propose an improved genetic algorithm (GA) for it. By adopting a new fitness function to consider simultaneously the path length and number of free wavelengths in cost estimation of a route, the new genetic RWA algorithm can achieve a good load balance among route candidates and result in a lower blocking probability than both the fixed alternative routing algorithm and the previous GA-based algorithm for DRWA, as verified by an extensive simulation study upon the ns-2 network simulator and some typical network topologies.