The spectrum assigment (SA) problem in optical networks: A multiprocesor scheduling perspective

The routing and spectrum assignment (RSA) problem has emerged as the key design and control problem in elastic optical networks. In this work, we provide new insight into the spectrum assignment (SA) problem in mesh networks by showing that it transforms to the problem of scheduling multiprocessor tasks on dedicated processors. Based on this new perspective, we show that the SA problem in paths 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 paths when the number of links is fixed. Finally, we introduce a suite of 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.