Algorithms for Deadline-Driven Dynamic Multicast Scheduling Problem in Elastic Optical Networks

In the paper we consider online deadline-driven multicast routing and spectrum assignment problem in elastic optical networks. Multicast demands with given volume appear dynamically and must be completed up to deadline. For each demand the problem consists in constructing of the multicast tree, assigning the modulation format, starting time and spectrum in elastic optical network. In the paper, we formulate the optimization problem and propose few heuristic algorithms. We propose original formulation of spectrum fragmentation metric and use it for constructing spectrum optimization algorithms. Finally, we present computational experiments for exemplifying networks, reporting the quality of heuristic solutions and characteristics of considered optimization problem.