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. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Le, V. T., Ngo, S. H., Jiang, X., Horiguchi, S., & Guo, M. (2004). A genetic algorithm for dynamic routing and wavelength assignment in WDM networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3358, 893–902. https://doi.org/10.1007/978-3-540-30566-8_103
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
