Algorithms for calculation of candidate trees for efficient multicasting in elastic optical networks

Multicast transmission defined as one-to-many is gaining much attention in recent years, due to the growing popularity of network services like multimedia streaming, IP television, software distribution. Simultaneously, evolution of optical networks focuses on the very promising approach of elastic optical networks (EONs) that provide high spectrally efficiency and support high-rate traffic demands in an efficient way. Thus, in this paper we concentrate on multicasting in EONs. Since according to recent results, one of the most efficient approaches to model and optimize multicasting in EONs is a candidate tree concept, we propose algorithms for generation of candidate trees for EON multicasting. Next, quality of the obtained sets of candidate trees is evaluated by running a RSA algorithm with the use of representative network topologies and with realistic EON assumptions.