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.

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

[2]  Yi Zhang,et al.  Traffic grooming in Spectrum-Elastic Optical Path Networks , 2011, 2011 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference.

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

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

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

[6]  Evripidis Bampis,et al.  On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[7]  George N. Rouskas,et al.  A fast path-based ILP formulation for offline RWA in mesh optical networks , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

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

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

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

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

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

[13]  Jianer Chen,et al.  A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors , 2000, ISAAC.

[14]  Yue Wei,et al.  Span restoration for CO-OFDM-based elastic optical networks under spectrum conversion , 2012, 2012 Asia Communications and Photonics Conference (ACP).

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

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