By Topic

Multiobjective Genetic Algorithms for Solving the Impairment-Aware Routing and Wavelength Assignment Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Monoyios, D. ; Comput. Eng. & Inf. Dept., Univ. of Patras, Rio, Greece ; Vlachos, K.

In future transparent (all-optical) WDM networks, the signal quality of transmission (QoT) will degrade due to physical layer impairments. In this paper, we propose two genetic algorithms for solving the static impairment-aware RWA (IA-RWA) problem by accounting for the impact of physical impairments in the optimization process when searching for the optimum routing path and wavelength channel. The first algorithm indirectly considers the physical impairments through the insertion of the path length and the number of common hops in the search process, using classical multiobjective optimization (MOO) strategies. The second algorithm is a single-objective genetic algorithm (GA) that uses the Q factor for the evaluation of the feasibility of the selected RWA solution. The Q factor is used in each iteration of the algorithm in a self-learning mode in order to evaluate the fitness of each solution to the RWA problem and trigger the evolution of the population. Performance results have shown that considering path length and number of common hops for indirectly handling impairments provide an efficient solution to the IA-RWA problem.

Published in:

Optical Communications and Networking, IEEE/OSA Journal of  (Volume:3 ,  Issue: 1 )