Abstract

The routing and spectrum assignment problem has emerged as the key design and control problem in elastic optical networks. In this work, we show that the spectrum assignment (SA) problem in mesh networks transforms to the problem of scheduling multiprocessor tasks on dedicated processors. Based on this new perspective, we show that the SA problem in chain (linear) networks is NP-hard for four or more links, but is solvable in polynomial time for three links. We also develop new constant-ratio approximation algorithms for the SA problem in chains when the number of links is fixed. Finally, we present several list scheduling algorithms that are computationally efficient and simple to implement, yet produce solutions that, on average, are within 1%–5% of the lower bound.

© 2014 Optical Society of America

On Distance-Adaptive Routing and Spectrum Assignment in Mesh Elastic Optical Networks

Sahar Talebi and George N. Rouskas
J. Opt. Commun. Netw. 9(5) 456-465 (2017)

Dynamic Routing and Spectrum Allocation in Elastic Optical Networks With Mixed Line Rates

Xiong Wang, Kaixuan Kuang, Sheng Wang, Shizhong Xu, Hong Liu, and Gordon Ning Liu
J. Opt. Commun. Netw. 6(12) 1115-1127 (2014)

Towards Elastic and Fine-Granular Bandwidth Allocation in Spectrum-Sliced Optical Networks

Yang Wang, Xiaojun Cao, Qian Hu, and Yi Pan
J. Opt. Commun. Netw. 4(11) 906-917 (2012)

Solving Large Instances of the RSA Problem in Flexgrid Elastic Optical Networks

Mirosław Klinkowski, Mateusz Żotkiewicz, Krzysztof Walkowiak, Michał Pióro, Marc Ruiz, and Luis Velasco
J. Opt. Commun. Netw. 8(5) 320-330 (2016)

Dynamic Routing and Spectrum Assignment in Spectrum-Flexible Transparent Optical Networks

Xin Wan, Nan Hua, and Xiaoping Zheng
J. Opt. Commun. Netw. 4(8) 603-613 (2012)