Dynamic routing and spectrum allocation in elastic optical networks with mixed line rates

We focus on the dynamic Routing and Spectrum Allocation (RSA) problem in EONs with mixed line rates. To solve the dynamic RSA problem efficiently, we decompose the problem into routing and spectrum allocation sub-problems. For the routing sub-problem, we propose an efficient multi-constrained routing algorithm, Sorted Feasible Paths Searching (SFPS), to find the shortest feasible paths for the dynamic traffic demands. For the spectrum allocation sub-problem, we propose a spectrum allocation strategy named Adaptive Segmentation (AS) to allocate spectrum for the non-commensurate traffic demands of EONs with mixed line rates. Simulation results prove that the proposed dynamic RSA algorithm is time-efficient and perform better than existing dynamic RSA algorithms in terms of bandwidth blocking probability and spectrum fragmentation ratio.