Analysis and Optimization of Robustness in Multiplex Flow Networks Against Cascading Failures

Networked systems are susceptible to cascading failures, where the failure of an initial set of nodes propagates through the network, often leading to system-wide failures. In this work, we propose a multiplex flow network model to study robustness against cascading failures triggered by random failures. The model is inspired by systems where nodes carry or support multiple types of flows, and failures result in the redistribution of flows within the same layer rather than between layers. To represent different types of interdependencies between the layers of the multiplex network, we define two cases of failure conditions: layer-independent overload and layerinfluenced overload. We provide recursive equations and their solutions to calculate the steady-state fraction of surviving nodes, validate them through a set of simulation experiments, and discuss optimal load-capacity allocation strategies. Our results demonstrate that allocating the total free space (i.e., capacity minus initial load) to each layer proportional to the mean effective load in the layer and distributing that free space equally among the nodes within the layer ensures maximum robustness. The proposed framework for different failure conditions allows us to analyze the two overload conditions presented and can be extended to explore more complex interdependent relationships.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Network Science and Engineering
Published
2025-08-18
DOI
https://doi.org/10.1109/tnse.2025.3600171
Citations
1
Primary Topic
Smart Grid Security and Resilience
Type
article
Field-Weighted Citation Impact
1.21
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Analysis and Optimization of Robustness in Multiplex Flow Networks Against Cascading Failures

Osman Yağan, Orkun İrsoy
1 citations
IEEE Transactions on Network Science and Engineering
Smart Grid Security and Resilience
1.21
article

Analysis and Optimization of Robustness in Multiplex Flow Networks Against Cascading Failures

Osman Yağan, Orkun İrsoy
article en
1 citations

Abstract

Networked systems are susceptible to cascading failures, where the failure of an initial set of nodes propagates through the network, often leading to system-wide failures. In this work, we propose a multiplex flow network model to study robustness against cascading failures triggered by random failures. The model is inspired by systems where nodes carry or support multiple types of flows, and failures result in the redistribution of flows within the same layer rather than between layers. To represent different types of interdependencies between the layers of the multiplex network, we define two cases of failure conditions: layer-independent overload and layerinfluenced overload. We provide recursive equations and their solutions to calculate the steady-state fraction of surviving nodes, validate them through a set of simulation experiments, and discuss optimal load-capacity allocation strategies. Our results demonstrate that allocating the total free space (i.e., capacity minus initial load) to each layer proportional to the mean effective load in the layer and distributing that free space equally among the nodes within the layer ensures maximum robustness. The proposed framework for different failure conditions allows us to analyze the two overload conditions presented and can be extended to explore more complex interdependent relationships.

IEEE Transactions on Network Science and EngineeringVol. 13
Carnegie Mellon University (US)
Climate action
Openalex Percentile: Top 18%
Smart Grid Security and Resilience
1.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.