## Abstract

We consider the routing and spectrum allocation (RSA) problem of protecting all-optical multicast sessions against a single link failure in elastic optical networks (EONs). A tree is derived to support a multicast session and can be considered as a set of paths originating from a common source. We use a scheme to protect each of the paths by an arc-disjoint backup path in the case of any link failure. For this problem, we provide a node-arc integer linear programming (ILP) formulation and propose a heuristic algorithm for this protection scheme. We evaluate the improvement achieved by the flexible grids adopted in EONs over the fixed-grid wavelength-division multiplexing (WDM) networks. The evaluation is done by considering static modeling based on ILP and heuristics as well as dynamic simulations. We consider two approaches for heuristic algorithms: one is a two-step (TS) approach that computes the routing trees then allocates spectrum. The other uses the spectrum window plane (SWP) and constructs auxiliary graphs for the relevant range of spectrum to jointly solve the RSA problem. We evaluate the performances of the proposed algorithms under static and dynamic traffic models. Based on the studied scenarios, we observe consistent improvement in efficiency of flexible grid EONs over fixed-grid WDM networks. Moreover, we demonstrate that the network size (likely because of the availability of more alternative routes) can significantly affect the benefit in efficiency achieved by the SWP-based approaches over the TS approaches.

© 2017 Optical Society of America

Full Article | PDF Article**More Like This**

F. Cugini, M. Ruiz, T. Foggi, L. Velasco, N. Sambo, and P. Castoldi

J. Opt. Commun. Netw. **9**(12) 1074-1084 (2017)

Long Gong, Xiang Zhou, Xiahe Liu, Wenwen Zhao, Wei Lu, and Zuqing Zhu

J. Opt. Commun. Netw. **5**(8) 836-847 (2013)

Taiming Feng, Lu Ruan, and Wensheng Zhang

J. Opt. Commun. Netw. **2**(7) 389-399 (2010)