Abstract

We present a theoretical study of the routing and spectrum assignment (RSA) problem in ring networks. We first show that the RSA problem with fixed-alternate routing in general-topology (mesh) networks (and, hence, in rings as well) is a special case of a multiprocessor scheduling problem. We then consider bidirectional ring networks and investigate two problems: 1) the spectrum assignment problem under the assumption that each demand is routed along a single fixed path (e.g., the shortest path), and 2) the general case of the RSA problem whereby a routing decision along the clockwise and counter-clockwise directions must be made jointly with spectrum allocation. Based on insights from multiprocessor scheduling theory, we derive the complexity of the two problems and develop new constant-ratio approximation algorithms with a ratio that is strictly smaller than the best known ratio to date.

© 2014 IEEE

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)

Spectrum Assignment in Optical Networks: A Multiprocessor Scheduling Perspective

Sahar Talebi, Evripidis Bampis, Giorgio Lucarelli, Iyad Katib, and George N. Rouskas
J. Opt. Commun. Netw. 6(8) 754-763 (2014)

On the Complexity of Routing and Spectrum Assignment in Flexible-Grid Ring Networks [Invited]

Massimo Tornatore, Cristina Rottondi, Roza Goscien, Krzysztof Walkowiak, Giuseppe Rizzelli, and Annalisa Morea
J. Opt. Commun. Netw. 7(2) A256-A267 (2015)

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)

Routing, Modulation Level, and Spectrum Assignment in Optical Metro Ring Networks Using Elastic Transceivers

Cristina Rottondi, Massimo Tornatore, Achille Pattavina, and Giancarlo Gavioli
J. Opt. Commun. Netw. 5(4) 305-315 (2013)