A metaheuristic approach for optical network optimization problems

doi:10.1016/j.asoc.2012.09.011

2013-02-01

PRE

Urmila Bhanja *

Sudipta Mahapatra

DOI：10.1016/j.asoc.2012.09.011

原文链接

原文求助

摘要

En 中文

Two of the most complex optimization problems encountered in the design of third generation optical networks are the dynamic routing and wavelength assignment (DRWA) problem under the assumptions of ideal and non-ideal physical layers. Both these problems are NP-complete in nature. These are challenging due to the presence of multiple local optima in the search space. Even heuristics-based algorithms fail to solve these problems efficiently as the search space is non-convex. This paper reports the performance of a metaheuristic, that is, an evolutionary programming algorithm in solving different optical network optimization problems. The primary motivation behind adopting this approach is to reduce the algorithm execution time. It is demonstrated that the same basic approach can be used to solve different optimization problems by designing problem-specific fitness functions. Also, it is shown how the algorithm performance can be improved by integrating suitable soft constraints with the original constraints. Exhaustive simulation studies are carried out assuming the presence of different levels of linear impairments such as switch and demultiplexer crosstalk and non-linear impairments like four wave mixing to illustrate the superiority of the proposed algorithms. (C) 2012 Elsevier B.V. All rights reserved.

Keyword:

QoS routing

DRWA problem

Linear impairments

Non-linear impairments

Evolutionary programming algorithm

Convergence rate

Fitness function