Routing and wavelength assignment in all optical networks using differential evolution optimization

Authors:
Fernando Lezama;Gerardo Castañón;Ana Maria Sarmiento
Affiliations:
Department of Electrical and Computer Engineering, Tecnológico de Monterrey, Monterrey, Mexico 64849;Department of Electrical and Computer Engineering, Tecnológico de Monterrey, Monterrey, Mexico 64849;Department of Industrial Engineering, Tecnológico de Monterrey, Monterrey, Mexico
Venue:
Photonic Network Communications
Year:
2013

Citing 8
Cited 0

Routing and wavelength assignment in all-optical networks

IEEE/ACM Transactions on Networking (TON)
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
A survey on physical layer impairments aware routing and wavelength assignment algorithms in optical networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Optical Networks: A Practical Perspective, 3rd Edition

Optical Networks: A Practical Perspective, 3rd Edition
Differential Evolution: A Survey of the State-of-the-Art

IEEE Transactions on Evolutionary Computation
Differential evolution optimization applied to the wavelength converters placement problem in all optical networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
A practical approach for routing and wavelength assignment in large wavelength-routed optical networks

IEEE Journal on Selected Areas in Communications
Network Dimensioning under Scheduled and Random Lightpath Demands in All-Optical WDM Networks

IEEE Journal on Selected Areas in Communications - Part Supplement

Quantified Score

Hi-index	0.00

Visualization

Abstract

The routing and wavelength assignment (RWA) problem, known to be an NP-complete problem, seeks to optimally establish routes and adequate wavelengths for the requested connections according to an objective function. This paper presents the use of a novel approach based on a differential evolution (DE) algorithm to the RWA problem in wavelength-routed dense division multiplexing (DWDM) optical networks. The proposed DE-RWA algorithm is modeled to optimize not only the network wavelength requirement ($$ NWR $$NWR, which is the minimum number of wavelengths needed to fulfill traffic demand) but also the average path length ($$ APL $$APL). We present the impact of the control parameters of the DE algorithm on the improvement of system's performance. Additionally, we present two strategies to improve the efficiency of the algorithm, knowing as the disjoint cut-set paths (DCS-P) algorithm and the use of a random mutation ($$ random -M$$random-M) parameter for DE. The proposed approach is evaluated for test bench optical networks with up to 40 nodes. Experiments show that the DE-RWA algorithm obtains results that equal the $$ NWR $$NWR lower bound for networks with and without wavelength conversion capability, whereas reduce the $$ APL $$APL. The performance of the DE-based approach is compared against results obtained with the particle swarm optimization (PSO) and genetic algorithm (GA) models, showing that the DE-RWA outperform those algorithms. The presented DE-RWA model is simple to implement and could also be extended by adding other features such as impairment-aware, energy efficient, survivability among others in optical networks.