Guide to Disaster-Resilient Communication Networks

Rak, Jacek; Hutchison, David

doi:10.1007/978-3-030-44685-7

Cited by 30 publications

(8 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The most common strategies of T As [7], [23] are based on three node centrality metrics from graph theory: node degree, node closeness and node betweenness. Consider the data plane topology modeled by a graph G = (N, E) with a given set N of switches and a given set E of connecting links.…”

Section: ) Targeted Attacks (T As)mentioning

confidence: 99%

“…Besides centrality-based T As, another attack strategy has also been considered more recently in the evaluation of telecommunication networks to attacks against multiple nodes [30], which is based on an optimization problem known as the critical node detection (CND) problem. CND was first introduced in [27], where it was shown to be N P-hard, and, since then, different variants of CND have been addressed in different contexts [31].…”

Section: ) Targeted Attacks (T As)mentioning

confidence: 99%

“…By shutting down these nodes, the attacker is able to split the network into three components -one with two nodes (4 and 5), one with three nodes (10, 11 and 12) and one with four nodes (2, 3, 6 and 7) -and the resulting number of node pairs that can communicate in the surviving network is 10, the lowest possible value in the shutdown of any set of three nodes of this topology. In [30], a vulnerability evaluation of telecommunication topologies was conducted comparing the CND-based attack strategy with the previously described centrality-based attack strategies. The main conclusions are two-fold.…”

Section: ) Targeted Attacks (T As)mentioning

confidence: 99%

“…The other is that the most damaging centrality-based strategies are obtained with the 'sequential' variant. Although the work in [30] does not address the particular case of SDNs, since connectivity is a necessary condition to maintain the services after an attack, the same behavior is likely to happen in SDNs, the reason why in the computational results we only consider the 'sequential' strategy in the centrality-based T As.…”

Section: ) Targeted Attacks (T As)mentioning

confidence: 99%

“…Multiple failures can be caused by different reasons, as natural disasters, technology related failures or human malicious activities [7], [8]. Multiple failures might involve either link failures only, or node and link failures (since a node failure implies that its connected links also fail).…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Assessment of Connectivity-Based Resilience to Attacks Against Multiple Nodes in SDNs

et al. 2021

View full text Add to dashboard Cite

In Software Defined Networks (SDNs), the control plane of a network is decoupled from its data plane. For scalability and robustness, the logically centralized control plane is implemented by physically placing different controllers throughout the network. The determination of the number and placement of controllers is known as the Controller Placement Problem (CPP). In the regular (i.e., failurefree) state, the control plane must guarantee a given maximum delay between every switch and its primary controller and a given maximum delay between every pair of controllers. In general, these delay bounds allow multiple solutions and, so, other goals can be used to determine the best CPP solution. In this paper, we assess the connectivity-based resilience to malicious attacks against multiple network nodes of the CPP solutions obtained with three different aims: the regular state delay optimization without any concern about attacks, the regular state delay optimization taking into consideration the worst-case attacks and the resilience optimization to attacks against multiple nodes. We assess the CPP solutions considering attacks of targeted nature (when the attacker has complete knowledge of the data plane) and attacks of nontargeted nature (i.e., random and epidemic attacks). We present computational results providing an analysis of the CPP solutions to the different types of attacks. The main conclusion is that the connectivity-based resilience between the different CPP solutions strongly depends on the network topology, the regular state delay bounds and the type of attacks. Finally, we provide insights on how SDN operators can consider the conducted assessment when deciding the controller placements in their networks.

show abstract

Section: ) Targeted Attacks (T As)mentioning

confidence: 99%

Section: ) Targeted Attacks (T As)mentioning

confidence: 99%

Section: ) Targeted Attacks (T As)mentioning

confidence: 99%

Section: ) Targeted Attacks (T As)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Assessment of Connectivity-Based Resilience to Attacks Against Multiple Nodes in SDNs

et al. 2021

View full text Add to dashboard Cite

show abstract

A new linear path pair availability constraint for network design

Martins,

Santos,

Girão‐Silva

et al. 2024

Networks

View full text Add to dashboard Cite

It is essential for network operators to guarantee required levels of availability in the network without incurring in excessive costs. We address the optimization problem of upgrading links at a given cost, to achieve end‐to‐end availability guarantees in the network, via pairs of working and backup paths. These guarantees are expressed as nonlinear path pair availability constraints which cannot be readily linearized. For this reason, most works have only considered the working path availability or disaggregated models where availability guarantees are considered separately for the working and backup paths. We show that the aggregated models which jointly consider the availabilities of the working and backup paths can provide better solutions than the disaggregated models. Moreover, we present a more efficient aggregated model based on a novel strategy to linearize the path pair availability constraints, and show that it further improves previous results. It is usual to impose that the upgraded links belong to a spanning tree subgraph. We further compare the solutions with and without this imposition and show that relaxing the tree condition can provide better solutions.

show abstract

Related Work

Vass

2022

Springer Theses

View full text Add to dashboard Cite

Guide to Disaster-Resilient Communication Networks

Cited by 30 publications

References 0 publications

Assessment of Connectivity-Based Resilience to Attacks Against Multiple Nodes in SDNs

Assessment of Connectivity-Based Resilience to Attacks Against Multiple Nodes in SDNs

A new linear path pair availability constraint for network design

Related Work

Contact Info

Product

Resources

About