ILP model and effective genetic algorithm for routing and spectrum allocation in elastic optical networks

Abstract

This paper proposes an integer linear programming (ILP) formulation and an effective heuristic based on genetic algorithm (GA) for static routing and spectrum allocation (RSA) problem in spectrum-sliced elastic optical path network (SLICE). The RSA problem belongs to the class of problems called NP-Hard, and then approaches to achieve optimal solutions are limited to solve only small instances. For real networks optimal methods cannot give a solution in viable time, hence heuristic approaches are required. Then, we propose an ILP model and Genetic Algorithm (GA) to optimize the RSA problem in SLICE network. In spite of scalability problem an integer linear programming (ILP) formulation is presented, with the goal of attaining optima solutions for small networks and ascertaining our heuristic's efficiency. In addition, it is presented a detailed analysis for GA's parameters.