The spectrum assigment (SA) problem in optical networks: A multiprocesor scheduling perspective - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

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

Sahar Talebi
  • Function : Author
Evripidis Bampis
  • Function : Author
  • PersonId : 855947
Giorgio Lucarelli
Iyad Katib
  • Function : Author
George Rouskas
  • Function : Author

Abstract

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.
No file

Dates and versions

hal-01215578 , version 1 (14-10-2015)

Identifiers

  • HAL Id : hal-01215578 , version 1

Cite

Sahar Talebi, Evripidis Bampis, Giorgio Lucarelli, Iyad Katib, George Rouskas. The spectrum assigment (SA) problem in optical networks: A multiprocesor scheduling perspective. 18th Conference on Optical Network Design and Modeling (ONDM 2014), May 2014, Stockholm, Sweden. pp.55-60. ⟨hal-01215578⟩
52 View
0 Download

Share

Gmail Facebook X LinkedIn More