Core Percolation in Interdependent Networks

Zhang, Jiapeng; Fu, Luoyi; Li, Shuhao; Yao, Yuhang; Wang, Xinbing

doi:10.1109/tnse.2018.2884774

Cited by 5 publications

(1 citation statement)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, we consider nodes v ∈ V P ∪ V C such that the failure of v creates a failures cascade cover of size greater than f and new cascade-reduction links (similarly to the operations in lines 11-16), with the objective of limiting the maximum size of any CC to k (lines [17][18][19][20][21][22]. Finally, we return the set of all the obtained interconnection links, R.…”

Section: Heuristic Approachmentioning

confidence: 99%

Cascading-failure-resilient interconnection for interdependent power grid - Optical network

Habib

Musumeci

Tornatore

et al. 2021

Optical Switching and Networking

View full text Add to dashboard Cite

Section: Heuristic Approachmentioning

confidence: 99%

Cascading-failure-resilient interconnection for interdependent power grid - Optical network

Habib

Musumeci

Tornatore

et al. 2021

Optical Switching and Networking

View full text Add to dashboard Cite

Robustness improvement strategy of cyber-physical systems with weak interdependency

Wang

Chen

et al. 2023

Reliability Engineering & System Safety

View full text Add to dashboard Cite

A Braess’s Paradox Inspired Method for Enhancing the Robustness of Air Traffic Networks

Cai

Alam

Ang

et al. 2020

2020 IEEE Symposium Series on Computational Intelligence (SSCI)

View full text Add to dashboard Cite

Air traffic is operated in an air traffic network (ATN) environment. It is of great significance to improve the robustness of ATNs as they are frequently exposed to manifold uncertainties which can break down the functioning components of an ATN. Existing studies on improving the robustness of ATNs either rewire the links of a network or add more links to the network. In this paper we suggest a Braess's Paradox inspired method. Specifically, we propose to improve the robustness of an ATN by removing some of its edges. In order to determine the edges whose removal can improve the robustness of a given ATN, we develop a bi-objective optimization model with one objective maximizing the network's robustness and the other one minimizing the number of links to be removed. We further apply and modify a non-dominated sorting genetic algorithm (NSGA-II) to optimize the developed model. In order to validate the effectiveness of the proposed idea, we carry out experiments on nine real-world ATNs. We also compare the modified NSGA-II algorithm against NSGA-III, and MODPSO, which are famous and efficient multiobjective evolutionary algorithms. Experiments indicate that NSGA-II outperforms the compared algorithms and that the robustness of an ATN indeed can be improved by just removing a small amount of its edges. For the tested ATNs, three networks have their robustness improved by 100% by removing less than six edges while the remaining six get an improvement of around 10%. This work provides a new perspective for aviation decision makers to better design and manage ATNs.

show abstract

Core Percolation in Interdependent Networks

Cited by 5 publications

References 46 publications

Cascading-failure-resilient interconnection for interdependent power grid - Optical network

Cascading-failure-resilient interconnection for interdependent power grid - Optical network

Robustness improvement strategy of cyber-physical systems with weak interdependency

A Braess’s Paradox Inspired Method for Enhancing the Robustness of Air Traffic Networks

Contact Info

Product

Resources

About