The routing and spectrum assignment (RSA) is one of the key problems in flexible optical networks. When in a gridless
fashion, the shortest-path RSA algorithms have exponential computational complexity, and are thus not suitable to be
employed in real networks. On the other hand, today most optical components cannot support fully gridless tunability,
which also limits the application of gridless RSA schemes. In this paper, we propose a novel grid-based spectrum-scan
routing (SSR) scheme in flexible optical networks. The SSR scheme achieves optimal routing with a polynomial
computational complexity. Compared with other RSA schemes, SSR has shorter computation time, lower blocking
probability, and higher resource utilization.
This paper studies the dynamic Routing and Spectrum Assignment (RSA) problem in Bandwidth Flexible Optical
networks. We propose a k-path Signaling-based RSA scheme and simulation results show that it performs much better
than other RSA schemes in Bandwidth Flexible Optical networks.
A dynamic domain-sequencing scheme is proposed for Backward Recursive Path Computation Element (PCE) -Based
Computation (BRPC) in multi-domain WDM networks. Simulation evaluation shows that the proposed scheme is
effective in inter-domain path computation with more efficient resource utilization and lower blocking probabilities.