Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort

Girão‐Silva, Rita; Nedic, Boro; Gunkel, Matthias; Gomes, Teresa

doi:10.1002/net.21931

Cited by 11 publications

(8 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kucharzak et al [129], Fouquet et al [86], Yang et al [225], Cheng et al [54], Myslitski et al [150], Busing et al [45], and Natalino et al [151] examine novel post‐perturbation routing or path selection protocols. Houthooft et al [114], Papadimitriou and Fortz [167], Gomes et al [97], Hmaity et al [107], Girão‐Silva et al [94], and Kalesnikau et al [123] consider problems that integrate network design or operations pre‐perturbation with effective routing post‐perturbation. Ali et al [8] and Pasic et al [169] examine methods to identify locations of failures after a disruption.…”

Section: Optimization Models and Network Robustnessmentioning

confidence: 99%

In search of network resilience: An optimization‐based view

et al. 2020

View full text Add to dashboard Cite

Fifty years of research in Networks coincides with 50 years of advances in resilience theory and applications. The purpose of this review is to identify how these two technical communities influenced each other in the past and can bolster each other in the future. Advances in resilience theory show that there are at least four ways networks demonstrate resilience: robustness, rebound, extensibility, and adaptability. Research published in Networks and by the broader network optimization community has focused primarily on technical methods for robustness and rebound. We review this literature to organize seminal problems and papers on the ability of networks to manage increasing stressors and return to normal activities after a stressful event. In contrast, the Networks community has made less progress addressing issues for network extensibility and adaptability. Extensibility refers to the ability to stretch current operations to surprising situations and adaptability refers to the ability to sustain operations into the future. We discuss ways to harness existing network optimization methods to study these forms of resilience and outline their limitations. We conclude by providing a research agenda that ensures the Networks community remains central to future advances in resilience while being pragmatic about the limitations of network optimization for achieving this task.

show abstract

Section: Optimization Models and Network Robustnessmentioning

confidence: 99%

In search of network resilience: An optimization‐based view

et al. 2020

View full text Add to dashboard Cite

show abstract

“…Next, a brief description of the addressed Linear Programming (LP) problems is presented -for the description of notation and a mathematical formulation, see [36]. Note that each LP problem was solved for a demand from a node s to a node d in the network: The resolution of these problems gives us the appropriate path pairs and also the appropriate number and location of regenerators, for each demand.…”

Section: Srlg-disjoint and Geodiverse Routing -A Trade-off Between Be...mentioning

confidence: 99%

Disaster-Resilient Routing Schemes for Regional Failures

Gomes

Santos

Girão‐Silva

et al. 2020

Computer Communications and Networks

Self Cite

View full text Add to dashboard Cite

Large scale natural disasters can have a profound effect on the telecommunication services in the affected geographical area. Hence, it is important to develop routing approaches that may help in circumventing damaged regional areas of a network. This prompted the development of geographically diverse routing schemes and also of disaster-risk aware routing schemes. A minimum-cost geodiverse routing, where a minimum geographical distance value D is imposed between any intermediate element of one path and any element of the other path is presented. Next the problem of the calculation of a D-geodiverse routing solution which ensures a certain level of availability is tackled. An algorithm is described that either obtains a solution to that problem or the most available path pair satisfying the desired geographical distance value D -this can be useful for the specification of availability levels in Service Level Agreements. Finally, a case study is presented, in an optical network, to determine the cost increase in terminal equipment (transponders) of approaches to ensure a much larger separation of the paths (of the selected path pair), with respect to minimal length link-disjoint routing. An Introduction to Geographically Diverse RoutingThe occurrence of large-scale disasters such as hurricanes, tsunamis, or earthquakes may cause a number of failures with a profound effect in the telecommunication services in a * This chapter is based on work from COST Action CA15127 ("Resilient communication services protecting end-user applications from disaster-based failures -RECODIS") supported by COST (European Cooperation in Science and Technology).

show abstract

“…However, adverse events over EON networks, such as optical fiber cuts, can disrupt communications for millions of users, which can lead to a great loss of data and revenue. Other components may also incur even more harmful failures, but they are not as frequent [4][5][6][7], so this paper will consider only the effects of fiber cuts.…”

Section: Introductionmentioning

confidence: 99%

“…As it can be seen, for the same amount of traffic for each source destination node pairs, Scenario I, which provides DPP for every node, consumes practically the double amount of resources than any other combination of protection mechanisms analysed. When one compares Scenario II with Scenario III, it is possible to observe that, conceding to the source destination pairs(2,5) and(5,2), the increase in the amount of squeezed traffic from β(s, d) = 33% (Scenario II) to β(s, d) = 66% (Scenario III) incurs in reductions to the number of used slots. Likewise, similar reductions may also be achieved with Scenario IV by reducing the number of allowed concurrent path failures from N F = 2 (Scenario II) to N F = 1 (Scenario IV) while keeping the same squeezing factor.…”

mentioning

confidence: 99%

“…Finally, it is important to highlight that few additional slots are required when one compares the scenario without protection (dashed red line) with Scenarios II, III and IV, which provide protection for node pairs (2,5) and (5,2) against two link failures and 1/3 of squeezing (Scenarios II), two link failures and 2/3 of squeezing (Scenario III) and single link failure and 1/3 of squeezing. Mainly when it is perceived that dedicated path protection (Scenario I) applied to node pairs(2,5) and(5,2) requires more than the double of slots of no protection scenario.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Squeezed Protection in Elastic Optical Networks Subject to Multiple Link Failures

Assis¹,

Almeida²,

Dias³

et al. 2021

Preprint

View full text Add to dashboard Cite

<div>Elastic optical network (EON) is fast becoming a key solution for designing optical network with better usage of spectrum resources or other objectives of interest to tenant and/or operators. A primary concern of EONs is to protect the network against failures of its elements, because this kind of event can provoke the loss of substantial amount of traffic. In this paper, we propose a new mixed integer linear programming (MILP) formulation for protecting the network traffic against multiple link failures. The key idea is to use bandwidth squeezing together with grooming capability to provide few extra traffic for protection and guarantee a minimum bandwidth for each source–destination node pair under multiple failure events. The proposed formulation solves the virtual topology design problem jointly with the grooming, routing, modulation and spectrum allocation (RMSA) tasks. Due to the non-deterministic polynomial time (NP-hard) nature of the proposed MILP formulation, a heuristic strategy (referred to as two-step MILP) for large networks is also proposed. The solutions and performance of the proposed MILP formulation and two-step MILP analyzed through case studies in a small network. In addition, the performance of three large networks is assessed for cases scenarios where connections are under different service-level agreement (SLA). In view of proposed formulation and two-step MILP, it is possible to identify the configurations that ensure better usage of spectrum resources with different kinds of protection against single or multiple link failures.</div>

show abstract

Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort

Cited by 11 publications

References 34 publications

In search of network resilience: An optimization‐based view

In search of network resilience: An optimization‐based view

Disaster-Resilient Routing Schemes for Regional Failures

Squeezed Protection in Elastic Optical Networks Subject to Multiple Link Failures

Contact Info

Product

Resources

About