An efficient genetic algorithm approach for solving routing and spectrum assignment problem

In flex-grid optical network, routing and spectrum assignment (RSA) problem is a crucial task for planning and operating. Due to the non-deterministic polynomial time (NP-hard) complexity of problem, efficient computing techniques are always sought out with the aim to not only achieve good solutions...

Full description

Saved in:
Bibliographic Details
Published in2017 International Conference on Recent Advances in Signal Processing, Telecommunications & Computing (SigTelCom) pp. 187 - 192
Main Authors Dao Thanh Hai, Kha Manh Hoang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.01.2017
Subjects
Algorithm design and analysis
Biological cells
Fiber-optic Network
Flex-grid
Genetic Algorithm
Genetic algorithms
Integer Linear Programming
Network Optimization
Optical fiber networks
Routing
Signal processing algorithms
WDM networks
Online AccessGet full text

Cover

More Information
Summary:In flex-grid optical network, routing and spectrum assignment (RSA) problem is a crucial task for planning and operating. Due to the non-deterministic polynomial time (NP-hard) complexity of problem, efficient computing techniques are always sought out with the aim to not only achieve good solutions but also in an efficient time span. In this context, this paper addresses the static version of RSA problem in a single objective scenario. We propose efficient meta-heuristic based on genetic algorithm (GA) to provide (near-) optimal solutions to the problem. The effectiveness of GA-based heuristic is bench-marked with exact approach based on integer linear programming (ILP) and other traditional heuristics for a set of scenarios. It is shown that the proposed GA heuristic exhibits better performance than typical heuristics and indeed could achieve optimal solutions in most cases while the running time is still highly manageable.
DOI:10.1109/SIGTELCOM.2017.7849820