A metaheuristic approach for optical network optimization problems

Authors:
Urmila Bhanja;Sudipta Mahapatra
Affiliations:
Department of Electronics and Communication Engineering, Indira Gandhi Institute of Technology, Sarang, Odisha 759146, India;Department of E&ECE, Indian Institute of Technology, Kharagpur 721302, West Midnapur, West Bengal, India
Venue:
Applied Soft Computing
Year:
2013

Citing 9
Cited 0

Optical networks: a practical perspective

Optical networks: a practical perspective
Evolutionary Computation: Towards a New Philosophy of Machine Intelligence

Evolutionary Computation: Towards a New Philosophy of Machine Intelligence
Dynamic RWA Based on the Combination of Mobile Agents Technique and Genetic Algorithms in WDM Networks with Sparse Wavelength Conversion

IEICE - Transactions on Information and Systems
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
An evolutionary programming algorithm for finding constrained optimal disjoint paths for multihop communication networks

International Journal of Metaheuristics
In-Band crosstalk performance of WDM optical networks under different routing and wavelength assignment algorithms

IWDC'05 Proceedings of the 7th international conference on Distributed Computing
A genetic algorithm for shortest path routing problem and the sizing of populations

IEEE Transactions on Evolutionary Computation
Design methodology for WDM backbone networks using FWM-aware heuristic algorithm

Optical Switching and Networking
FWM aware evolutionary programming algorithm for transparent optical networks

Photonic Network Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.