Solving routing and spectrum allocation problems in flexgrid optical networks using pre-computing strategies

摘要

Flexible optical network architectures are considered a very promising solution where spectrum resources are allocated within flexible frequency grids. This paper presents a minimum spectrum utilization (SU) and average path length (APL) approach to solve the (off-line) routing and spectrum allocation problem (RSA) based on combining a simple ordering precomputation strategy, namely most subcarriers first (MSF) with three nature-inspired algorithms. These algorithms are ant colony optimization, differential evolution based relative position indexing ( DE- RPI), and differential evolution general combinatorial (DE-GC). We begin by showing that MSF is the most effective ordering pre-computation strategy when compared to other well-known typical heuristics in the literature, such as first-fit, and longest path first. Then, we apply MSF in combination with the three nature-inspired algorithms to simultaneously optimize the SU and APL. The usefulness of MSF ordering pre-computation strategy is presented via a comparison of results obtained when using and not using MSF under the same scenarios. The algorithms are evaluated in benchmark optical networks, such as the NSFNet, the European optical network, and the 40-node USA network. We show that DE-RPI with MSF ordering pre-computation is the best option to solve the RSA problem, obtaining an average improvement percentage in the range of 0.9772-4.4086% on the SU and from -0.1668 to 0.8511% on the APL when compared to other meta-heuristics, either with or without the MSF ordering policy.