Spectrum assignment in rings with shortest-path routing: Complexity and approximation algorithms

We study the spectrum assignment (SA) problem in ring networks with shortest path (or, more generally, fixed) routing. With fixed routing, each traffic demand follows a predetermined path to its destination. In earlier work, we have shown that the SA problem can be viewed as a multiprocessor problem. Based on this insight, we prove that, under the shortest path assumption, the SA problem can be solved in polynomial time in small rings, and we develop constant-ratio approximation algorithms for large rings. For rings of size up to 16 nodes (the maximum size of a SONET/SDH ring), the approximation ratios of our algorithms are strictly smaller than the best known ratio to date.

[1]  Arunabha Sen,et al.  On routing and spectrum allocation in spectrum-sliced optical networks , 2013, 2013 Proceedings IEEE INFOCOM.

[2]  Francesco Musumeci,et al.  Dynamic grooming and spectrum allocation in optical metro ring networks with flexible grid , 2013, 2013 15th International Conference on Transparent Optical Networks (ICTON).

[3]  Biswanath Mukherjee,et al.  A Survey on OFDM-Based Elastic Core Optical Networking , 2013, IEEE Communications Surveys & Tutorials.

[4]  George N. Rouskas,et al.  The spectrum assigment (SA) problem in optical networks: A multiprocesor scheduling perspective , 2014, 2014 International Conference on Optical Network Design and Modeling.

[5]  George N. Rouskas.  Routing and Wavelength Assignment in Optical WDM Networks , 2001 .

[6]  Masahiko Jinno,et al.  Elastic optical networking: a new dawn for the optical layer? , 2012, IEEE Communications Magazine.

[7]  Han Hoogeveen,et al.  Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations , 1994, Discret. Appl. Math..

[8]  Konstantinos Christodoulopoulos,et al.  Elastic Bandwidth Allocation in Flexible OFDM-Based Optical Networks , 2010, Journal of Lightwave Technology.

[9]  Yi Pan,et al.  A study of the routing and spectrum allocation in spectrum-sliced Elastic Optical Path networks , 2011, 2011 Proceedings IEEE INFOCOM.

[10]  Marc Ruiz,et al.  Modeling the routing and spectrum allocation problem for flexgrid optical networks , 2012, Photonic Network Communications.

[11]  A. Pattavina,et al.  Routing, modulation level, and spectrum assignment in optical metro ring networks using elastic transceivers , 2013, IEEE/OSA Journal of Optical Communications and Networking.

[12]  Piero Castoldi,et al.  On the optimal design of a spectrum-switched optical network with multiple modulation formats and rates , 2013, IEEE/OSA Journal of Optical Communications and Networking.

[13]  H. Takara,et al.  Dynamic optical mesh networks: Drivers, challenges and solutions for the future , 2009, 2009 35th European Conference on Optical Communication.

[14]  Moshe Zukerman,et al.  Spectrum-efficient and agile CO-OFDM optical transport networks: architecture, design, and operation , 2012, IEEE Communications Magazine.

[15]  Krzysztof Walkowiak,et al.  Routing and Spectrum Assignment in Spectrum Sliced Elastic Optical Path Network , 2011, IEEE Communications Letters.

[16]  George N. Rouskas,et al.  Spectrum management techniques for elastic optical networks: A survey , 2014, Opt. Switch. Netw..

[17]  Evripidis Bampis,et al.  Scheduling of Independent Dedicated Multiprocessor Tasks , 2002, ISAAC.