A Single–Multi-Path Combinatorial RMSA Algorithm with Least Resource Consumption in Semi-Filterless Optical Networks

Abstract

Filterless optical networks (FONs) have become a cost-effective solution for optical network deployment due to their low-cost characteristics. However, eliminating active switching elements causes signals to propagate over unintended links, wasting spectral resources. Therefore, semi-filterless optical networks (Semi-FONs) have become a more cost-effective solution. This paper mainly studies the routing, modulation, and spectrum assignment (RMSA) problem in semi-filterless optical networks. It proposes a single–multi-path combination (LR-SMPC) RMSA algorithm with the least resource consumption. The algorithm first obtains the K shortest paths that satisfy the conditions according to the K short path (KSP) algorithm and re-orders the paths according to the resource consumption path re-ordering strategy, selecting the three paths that consume the least resources as the set of candidate paths. Then, based on the single–multi-path combination scheme of the set of candidate paths, the resource consumption of each scheme and the maximum number of available spectrum blocks for each path is calculated, from which the single path or multi-path with the least resource consumption is selected to serve the request. We perform simulation experiments on two network topologies using Poisson traffic models and compare them with existing single-path algorithms (S-P), fixed spectrum assignment granularity algorithms (g = 1), and adaptation spectrum assignment algorithms (g adaptation) to evaluate the performance of the proposed algorithm. The simulation results show that the proposed algorithm exhibits better performance in terms of both blocking rate and spectrum utilization.

Keywords

• semi-filterless
• optical networks
• single–multi-path
• routing and spectrum assignment