Design of Elastic Optical Networks with the Max-RMSA approach
Max-RMSA; EON; MILP; Grooming;
Four formulations of Mixed Integer Linear Programming (MILP) will be presented to solve the problem of traffic maximization and spectrum routing, modulation and allocation (Max-RMSA) in elastic optical networks (EONs). The first two models are formulations without using the Grooming technique with and without predefined optical paths (NPSP - Non Predefined Shortest Paths) and (PSP - Predefined Shortest Paths), in which NPSP provides the global optimal solution, as it contains all the possibilities of network paths between each of the pairs of nodes, whereas the PSP provides, in general, a near-optimal solution, as it only has a set of predefined paths, thus reducing complexity and its search space. The last two models are also for solving Max-RMSA, however considering the use of the Grooming technique. Several simulations were carried out for each MILP and the results were analyzed in networks of small instances. For moderately large networks such as the National Science Foundation Network (NSFNET) only PSP formulations will be used, due to the complexity of NPSP formulations in networks with a higher number of instances, and a good solution can be found with a reasonable simulation time.