2017
DOI: 10.1109/tcomm.2017.2709302
|View full text |Cite
|
Sign up to set email alerts
|

Designing Optimal Interlink Patterns to Maximize Robustness of Interdependent Networks Against Cascading Failures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
23
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 43 publications
(25 citation statements)
references
References 23 publications
1
23
0
Order By: Relevance
“…Therefore, the ∆H problem is recognized as a design problem of an entire interdependent network discussed in [11] under these assumptions. Also, the work [22] claims that such a one-to-one provisioning relation realizes the robustness, while assuming certain structural characteristics of random graphs.…”
Section: Problem Analysismentioning
confidence: 99%
“…Therefore, the ∆H problem is recognized as a design problem of an entire interdependent network discussed in [11] under these assumptions. Also, the work [22] claims that such a one-to-one provisioning relation realizes the robustness, while assuming certain structural characteristics of random graphs.…”
Section: Problem Analysismentioning
confidence: 99%
“…Several research works describe CPSs as networks of small clusters of sub-networks, interconnected by communication links, fragile to cascading failures. 13,14 Furthermore, the literature includes many studies [15][16][17][18] that address this problem in complex systems, many of which cover the domain of power grids, which represent typical CPSs. In power grids, it has been proven that they have a higher rate of occurrences with effects such as electrical instability and large blackouts.…”
Section: Reliability Assurancementioning
confidence: 99%
“…is failed otherwise (23) where represents the number of edges in the network. Compared with Figure 6, it is found that the failure propagation path in Table 5 is consistent with the traffic congestion propagation process, which indicates that the proposed cascade failure model can accurately reflect the failure process of the actual traffic network after encountering random attacks such as traffic accidents.…”
Section: Traffic Network Failure Process Under the Proposedmentioning
confidence: 99%
“…Li et al [22] proposed the cascading failure model in scalefree (SF) networks, Watts-Strogatz (WS) networks, and ER networks by considering random attacks and analyzed the cascading failure process of three networks compared with the highest-load attack. Chattopadhyay et al [23] provided the optimal interdependence structures in order to improve the network robustness under random attacks. Ruj et al [24] modeled the network cascading failure of smart grids under random attacks and deliberate attacks, which will increase the resilience of the smart grid.…”
Section: Introductionmentioning
confidence: 99%