Multicast protection and grooming scheme in survivable WDM optical networks

Pradhan, Ashok Kumar; Ghose, Sayan; De, Tanmay

doi:10.1016/j.osn.2015.06.003

Cited by 8 publications

(5 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More specifically, constraint (7) expresses that a directed graph with |N | nodes can have at most |N | − 1 directed links. Constraint (8) guarantees for every subset of nodes S of the graph that the number of directed links connecting its nodes is at most |S| − 1, which practically means that there will be no cycles in the required tree. Constraints (9), (10) and (11) perform the routing of the BPs of every demand of each session in the exact same manner as (2), ( 3) and (4) for the WPs, respectively.…”

Section: Static Scenario: Joint Ilp 1 and 2 Formulationsmentioning

confidence: 99%

“…Constraints (9), (10) and (11) perform the routing of the BPs of every demand of each session in the exact same manner as (2), ( 3) and (4) for the WPs, respectively. Constraints ( 12) and ( 13) define which links are used for the BPs of a specific session ses, symmetrically with constraints (7) and (8), respectively. Constraints ( 14) and (15) make sure that the WP and the BP of a particular demand in each session are going to be link-disjoint in both directions of the link.…”

Section: Static Scenario: Joint Ilp 1 and 2 Formulationsmentioning

confidence: 99%

“…Reliability ensures that data reaches its destinations consistently, without disruption or loss, which is especially critical for real-time applications. Survivability mechanisms are essential to maintain communication even in the face of network failures, ensuring uninterrupted multicast sessions in scenarios of link or node failures, natural disasters, or deliberate attacks [7], [8], [9].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Optimal and Reliable Routing for Multicast Sessions in WDM Networks

Samonaki,

Mas-Machuca

2024

2024 20th International Conference on the Design of Reliable Communication Networks (DRCN)

View full text Add to dashboard Cite

This paper studies the problem of optimal and reliable routing for multicast sessions in wavelength-divisionmultiplexing (WDM) networks. The objective is to minimize the cost and the blocking probability when establishing several multicast sessions while guaranteeing protection against any single link failure. In the presence of static traffic, two different Integer Linear Programming (ILP) formulations, Joint ILP 1 and Joint ILP 2, find the working trees and the link-disjoint backup paths for the sessions simultaneously, with Joint ILP 2 choosing a specific number of links to route the working trees. The proposed ILPs reduce the cost by 25 -30 % while coping with a larger number of demands per session compared to stateof-the-art solutions. This work also addresses the problem in a dynamic environment, with sequential multicast sessions of random demands, by proposing an ILP for the optimal solution and a heuristic called Demand-Aware Tree-Forming Optimal Path Pairs (DA-TF-OPP). Dealing with one multicast session at a time, DA-TF-OPP takes into account the sequence in which the demands should be routed and provides a working tree to prevent traffic loops, along with the backup paths. Compared to the state-of-the-art, DA-TF-OPP provides up to 5 % lower average cost and up to 3 % lower average blocking probability.

show abstract

Section: Static Scenario: Joint Ilp 1 and 2 Formulationsmentioning

confidence: 99%

Section: Static Scenario: Joint Ilp 1 and 2 Formulationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimal and Reliable Routing for Multicast Sessions in WDM Networks

Samonaki,

Mas-Machuca

2024

2024 20th International Conference on the Design of Reliable Communication Networks (DRCN)

View full text Add to dashboard Cite

show abstract

“…So it is important to have survivability in the given network. Ashok Kumar Pradhan [7] proposed a method for survivability which is for multicast protection and also on the grooming. They are used shared segment protection for multicast protection.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The service rate μ at each node will vary as utilization of the network is     (7) From above queuing theory, it is easy to calculate the blocking probability at a node. The blocking probability of the network is…”

Section:   mentioning

confidence: 99%

Combiner Queues for Survivability in Optical WDM Mesh Network

Shinde¹,

Roslin²,

Patil³

2018

jcm

View full text Add to dashboard Cite

Survivability is the major problem in Wavelength Division Multiplexed (WDM) Optical network. Also, the selection of grooming node is another important issue in the Optical Mesh Network. Most of the work in the field of the optical network is focused of sparse traffic grooming and survivability as a separate issue. We here presented a novel approach for providing survivability to sparse traffic grooming. This survivability on sparse traffic grooming is considered for the failure of a link on sparse grooming network. When we have sparse grooming network and a link failure occurs then we are providing a solution of shared link using combiner queues. We have proved that the combiner queues help to reduce the blocking probability and also reduce the number of call dropping. We have presented the queuing model which helps to calculate the total requests at a node or in the entire network. The presented combiner queuing model is useful for the calculation of probabilities, as m server queuing system.

show abstract

P-cycle based protection scheme with cycle multiplexing and capacity balance for multicast service in substation communication network

et al. 2018

International Journal of Electrical Power & Energy Systems

View full text Add to dashboard Cite

Multicast protection and grooming scheme in survivable WDM optical networks

Cited by 8 publications

References 34 publications

Optimal and Reliable Routing for Multicast Sessions in WDM Networks

Optimal and Reliable Routing for Multicast Sessions in WDM Networks

Combiner Queues for Survivability in Optical WDM Mesh Network

P-cycle based protection scheme with cycle multiplexing and capacity balance for multicast service in substation communication network

Contact Info

Product

Resources

About