Multicast Routing and Distance-Adaptive Spectrum Allocation in Elastic Optical Networks With Shared Protection

We consider an elastic all-optical network, where each node is multicast-capable and does not support spectrum conversion. In such a network, for a given set of static multicast demands, we consider distance-adaptive spectrum resource allocation, and aim to optimize multicast routing, modulation, and spectrum assignment with shared protection in a way that minimizes the required spectrum resources for accommodating all multicast sessions. In our design, we provision each multicast demand by a light-tree where spectrum resources are allocated in all links included in the tree. We protect each light-tree from any single link failure in both directions by having a backup path that is link disjoint to the path from the source to each destination on the primary tree. We reserve spectrum resources in the links that are not in the primary tree but in the backup paths between all source-destination pairs. The reserved spectrum resources can be shared to protect multiple light-trees as long as they do not fail simultaneously. For such a problem, we provide a mixed integer linear programming formulation. We also develop a scalable heuristic algorithm with an attribute that enables it to improve the quality of the results at the cost of longer running times. Numerical results for small problems show that the heuristic algorithm performs close to the optimum. In addition, we use a Markov chain simulation of the network to evaluate the performance of our proposed algorithm in terms of blocking probability in a dynamic environment, which demonstrates a significant improvement over straightforward approaches.