Leveraging Light Forest With Rateless Network Coding to Design Efficient All-Optical Multicast Schemes for Elastic Optical Networks

Abstract

International audienceIn this paper, we study the multicast-capable routing , modulation and spectrum assignment (MC-RMSA) schemes that consider the physical impairments from both the transmission and light-splitting in elastic optical networks (EONs). Specifically, we propose to provision each multicast request with a light-forest which consists of one or more light-trees to avoid the dilemma that because of the accumulated physical impairments, a relatively large light-tree may have to use the lowest modulation-level and hence consume too many frequency slots (FS'). In order to further improve the spectral efficiency and compensate for the differential delays among the light-trees, we incorporate the rateless network coding (R-NC) in the multicast system. We first formulate an integer linear programming (ILP) model to solve the problem for static network planning. Then, we propose three time-efficient heuristics that leverage the set-cover problem and utilize layered auxiliary graphs. The simulation results indicate that in both the ILP and heuristics, the MC-RMSA with R-NC can achieve better performance on the maximum index of used FS' than that without. After that, we evaluate the heuristics in dynamic network provisioning. The results show that the MC-RMSA with R-NC can effectively improve the performance of all-optical multicast in EONs to reduce the blocking probability

A Layered Subtree Scheme for Multicast Communications in Large-Scale Elastic Translucent Optical Networks

“…Subtree multicasting has been studied in [13]- [16]. In [13], using an ILP formulation, three basic schemes were modeled for point-to-multipoint (P2MP) transmissions: single path, tree based, and subtree-based topologies.…”

“…An ILP was employed in a static scenario and a heuristic was employed in a dynamic scenario. In [16], a light forest based on rateless network coding was employed to create set-cover trees. Both ILP and heuristic algorithms were proposed and effective all-optical multicasting was obtained.…”

“…The second inefficiency manifests itself when a close destination to the source has to adopt the same spectrally inefficient modulation technique that is necessary for a farther destination. Additionally, since splitting the light in a tree further limits the reach of the modulation techniques, inefficient modulation techniques are the only choice for the joint provision of multiple destinations [13]- [16]. A newly suggested alternative, a subtree scheme, alleviates these drawbacks of a full tree-based structure.…”

A column generation technique for routing and spectrum allocation in cloud–ready survivable elastic optical networks

“…The anycast (Zhang and Zhu, 2014;Goścień et al, 2014;Lu et al, 2015) and multicast Liu et al, 2013;Yang et al, 2015) traffic in EONs was also studied, but not so precisely. Also, joint optimization of different types of flows in EONs was studied for the following combinations: unicast together with anycast Goścień et al, 2014), unicast with multicast , anycast with multicast and three types of flows simultaneously (Aibin et al, 2016).…”

Resource Allocation Using SPA Based on Different Cost Functions in Elastic Optical Networks

“…Contrary to this static approach, in the other group of routing algorithms, the algorithm dynamically searches and finds a route based on the current state of the network and hence different routes may be found and used in different times and in different stats of the network. For both approaches, one of the simple and efficient algorithms that is commonly used [8]- [10] is shortest path algorithm (SPT). This algorithm receives the graph of the network with weighted edges (the weights are the costs that will be defined on each link) and finds a route that has the least total cost.…”