Feature Issue on Next-Generation WDM Network Design and Routing (WDMN). We study the problems of routing and wavelength converter placement in optical networks with sparse wavelength conversion. We propose a new dynamic routing algorithm with two new path cost functions based on the concept of least-load routing (LLR) with sparse converter placement, and we discuss the application of genetic algorithms (GAs) to determine the optimal location of wavelength converters so that the call-blocking probability is minimized. Simulation results show that the proposed dynamic routing algorithms perform significantly better than shortest-path (SP) routing and fixed-alternative routing (FAR) in terms of the call-blocking probability. The GA model is able to obtain a nearly optimal solution of the wavelength converter placement problem within a reasonable time, and its performance is better than that of two other popular heuristic placement algorithms.
No takes yet. Share an insight, caveat, or question.
Hei et al. (2004) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: