Multicast routing algorithms for sparse splitting optical networks

Constantinou, Costas K.; Manousakis, Konstantinos; Ellinas, Georgios

doi:10.1016/j.comcom.2015.09.019

Cited by 11 publications

(5 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Future work will focus on the application of the proposed NADT protection scheme in mixed‐graph sparse‐splitting networks with DaC nodes , as well as on the embedding of NADT into routing heuristics for networks with capacity constraints. Finally, an ILP will be formulated for obtaining the optimal solutions (for small networks of a few nodes), which will be subsequently compared with the solutions obtained by the heuristics, so as to ascertain the accuracy of the proposed techniques.…”

Section: Resultsmentioning

confidence: 99%

Dedicated protection of multicast sessions in mixed‐graph sparse‐splitting optical networks

2017

Self Cite

View full text Add to dashboard Cite

Section: Resultsmentioning

confidence: 99%

Dedicated protection of multicast sessions in mixed‐graph sparse‐splitting optical networks

2017

Self Cite

View full text Add to dashboard Cite

“…Ongoing work focuses on the application of the proposed NADT protection scheme in mixed-graph sparse-splitting networks with DaC nodes [16], as well as on the embedding of NADT into routing heuristics for networks with capacity constraints. Furthermore, the performance evaluation of the adaptation of the underlying idea of NADT for the derivation of two link-disjoint multicast trees in optical networks with sparse-splitting capabilities is also being considered.…”

Section: Discussionmentioning

confidence: 99%

“…1, where s is the source node and nodes d 1 , d 2 , and d 3 (nodes colored black) are the destination nodes of the multicast session. The MC nodes are square-shaped, and the MI nodes are considered to be DoC (Drop-or-Continue) i.e., they can either transmit the optical signal to the following node or drop it locally [3], [4], [16]. The primary tree obtained by the MSH heuristic can be seen in Fig.…”

Section: A Arc-disjoint Trees Protection Scheme (Existing)mentioning

confidence: 99%

A New Arc-Disjoint-Trees scheme for survivable multicasting in mixed-graph sparse-splitting optical networks

Raposo

Gomes

Martins

et al. 2016

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)

Self Cite

View full text Add to dashboard Cite

This work addresses the problem of survivable multicast request provisioning in mixed-graph optical networks, where only a fraction of the nodes have optical splitting capabilities. An effective scheme for the calculation of a pair of disjoint trees, namely the New Arc-Disjoint Trees (NADT) protection scheme, is presented. The key idea of this technique is to gradually construct the primary tree, verifying that after the addition of each one of the destinations of the multicast session, a secondary (arc-disjoint) tree can still be obtained. The proposed protection technique is combined with two existing heuristics for multicast routing in mixed-graph sparse-splitting networks. Performance results demonstrate that the proposed NADT protection technique clearly outperforms the conventional approach in terms of blocking ratio, and presents a negligible increase of the average cost of the derived pair of arc-disjoint trees.

show abstract

“…A new multicast structure called light hierarchy is introduced in for single and multiple multicast requests in the sparse‐splitting WDM networks. The light hierarchy allows MI nodes to be traversed twice on the same wavelength.…”

Section: Related Workmentioning

confidence: 99%

Optimal and heuristic algorithms for all‐optical group multicast in resource‐constrained WDM networks

Yang

Huang

2016

Int J Communication

View full text Add to dashboard Cite

Summary Given a sparse‐splitting wavelength‐division multiplexing network with no wavelength converter, we study a group multicast problem that is how to transmit a number of multicast streams from the video server to multiple destinations simultaneously. To avoid the situation that the wavelengths are used up by the first few requests, one wavelength is available for each multicast request. Hence, some of destinations may not be included in the multicast trees because of the lack of wavelengths. Our goal is to construct a number of light trees with conflict‐free wavelengths for multiple requests so that the number of served clients is maximized. This problem is named as the revenue‐maximized and delay‐constrained group multicast routing problem. We first determine a set of multicast trees with the maximum number of served clients, then followed by the wavelength assignment to allocate the minimum number of wavelengths to the resulting trees. In this study, we propose two Integer Linear Programming ILP‐based algorithms for determining the optimal solutions for the light‐tree construction problem and the wavelength assignment problem, respectively. For large‐scale networks, two heuristics are introduced to solve the light‐tree construction problem approximately. A set of simulations are also provided for comparing performances of our algorithms against the other published methods. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

Multicast routing algorithms for sparse splitting optical networks

Cited by 11 publications

References 36 publications

Dedicated protection of multicast sessions in mixed‐graph sparse‐splitting optical networks

Dedicated protection of multicast sessions in mixed‐graph sparse‐splitting optical networks

A New Arc-Disjoint-Trees scheme for survivable multicasting in mixed-graph sparse-splitting optical networks

Optimal and heuristic algorithms for all‐optical group multicast in resource‐constrained WDM networks

Contact Info

Product

Resources

About