On Routing and Spectrum Assignment in Rings

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.

[1]  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).

[2]  Jianer Chen,et al.  On the Approximability of Multiprocessor Task Scheduling Problems , 2002, ISAAC.

[3]  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.

[4]  Jianer Chen,et al.  A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling , 2001, SIAM J. Comput..

[5]  Jianer Chen,et al.  General Multiprocessor Task Scheduling , 1999 .

[6]  Yvan Pointurier,et al.  Multicast in mobile backhaul with optical packet ring , 2013, 2013 IEEE 9th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob).

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

[8]  Masahiko Jinno,et al.  Distance-adaptive spectrum resource allocation in spectrum-sliced elastic optical path network [Topics in Optical Communications] , 2010, IEEE Communications Magazine.

[9]  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.

[10]  JinnoMasahiko,et al.  Distance-adaptive spectrum resource allocation in spectrum-sliced elastic optical path network , 2010 .

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

[12]  Lucio Bianco,et al.  Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors , 1995, Ann. Oper. Res..

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

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

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

[16]  Maria C. Yuang,et al.  Toward Wireless Backhaul Using Circuit Emulation Over Optical Packet-Switched Metro WDM Ring Network , 2013, Journal of Lightwave Technology.

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

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

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

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

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

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

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

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

[25]  Mikkel Thorup,et al.  OPT versus LOAD in dynamic storage allocation , 2003, STOC '03.

[26]  Yongjun Zhang,et al.  Round Robin Ring for Metro Wireless Backhaul Networks , 2013 .

[27]  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.

[28]  Marek Kubale,et al.  The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated Processors , 1987, Information Processing Letters.

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