On the complexity of routing and spectrum allocation in survivable elastic optical network with unicast and anycast traffic

In this paper, we focus on the routing and spectrum allocation (RSA) problem in survivable elastic optical networks (EONs) with unicast and anycast traffic demands. We study a number of problem versions which differ in the involved technological constraints and facilities entailed by the EON technology, as well as, in the applied protection scheme, namely, either dedicated path protection (DPP) or shared backup path protection (SBPP). Each problem version is formulated by means of two integer linear programming (ILP) models: slice-based and channel-based. Next, we analyse the problem complexity (in terms of the number of variables, constraints and processing time) when different technological options for the EON realization are assumed. Eventually, we discuss the slice-based and channel-based modelling approaches in terms of their impact on the ILP formulation complexity, as well as, possibility and ease to adapt to different problem versions.

[1]  Massimo Tornatore,et al.  On the complexity of routing and spectrum assignment in flexible-grid ring networks [Invited] , 2015, IEEE/OSA Journal of Optical Communications and Networking.

[2]  Michal Wozniak,et al.  Joint optimization of multicast and unicast flows in elastic optical networks , 2015, 2015 IEEE International Conference on Communications (ICC).

[3]  Andrzej Jajszczyk,et al.  Routing, Flow, and Capacity Design in Communication and Computer Networks - [Book Review] , 2005, IEEE Communications Magazine.

[4]  Krzysztof Walkowiak,et al.  Joint anycast and unicast routing for elastic optical networks: Modeling and optimization , 2013, 2013 IEEE International Conference on Communications (ICC).

[5]  Miroslaw Klinkowski,et al.  ILP modelling and joint optimization of anycast and unicast traffic in survivable elastic optical networks , 2016, Electron. Notes Discret. Math..

[6]  Krzysztof Walkowiak,et al.  Anycasting in connection-oriented computer networks: Models, algorithms and results , 2010, Int. J. Appl. Math. Comput. Sci..

[7]  Krzysztof Walkowiak,et al.  Joint anycast and unicast routing and spectrum allocation with dedicated path protection in Elastic Optical Networks , 2014, 2014 10th International Conference on the Design of Reliable Communication Networks (DRCN).

[8]  Wei Lu,et al.  Efficient resource allocation for all-optical multicasting over spectrum-sliced elastic optical networks , 2013, IEEE/OSA Journal of Optical Communications and Networking.

[9]  M. Jinno,et al.  Algorithms for maximizing spectrum efficiency in elastic optical path networks that adopt distance adaptive modulation , 2010, 36th European Conference and Exhibition on Optical Communication.

[10]  V. Lopez,et al.  Traffic and power-aware protection scheme in Elastic Optical Networks , 2012, 2012 15th International Telecommunications Network Strategy and Planning Symposium (NETWORKS).

[11]  Krzysztof Walkowiak,et al.  Routing and spectrum allocation algorithms for elastic optical networks with dedicated path protection , 2014, Opt. Switch. Netw..

[12]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[13]  Krzysztof Walkowiak,et al.  Distance-adaptive transmission in cloud-ready elastic optical networks , 2014, IEEE/OSA Journal of Optical Communications and Networking.

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

[15]  M. Tornatore,et al.  Survivable Traffic Grooming in Elastic Optical Networks—Shared Protection , 2013, Journal of Lightwave Technology.

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

[17]  Krzysztof Walkowiak,et al.  Shared backup path protection in elastic optical networks: Modeling and optimization , 2013, 2013 9th International Conference on the Design of Reliable Communication Networks (DRCN).