## 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

Full Article | PDF Article**OSA Recommended Articles**

Sahar Talebi and George N. Rouskas

J. Opt. Commun. Netw. **9**(5) 456-465 (2017)

Ching-Fang Hsu, Yuan-Chih Chang, and Siou-Ci Sie

J. Opt. Commun. Netw. **8**(7) 507-520 (2016)

Yang Wang, Xiaojun Cao, Qian Hu, and Yi Pan

J. Opt. Commun. Netw. **4**(11) 906-917 (2012)