"Selfish" algorithm for optimizing the network survivability analysis
Svetlana V. Poroseva

TL;DR
This paper introduces a new algorithm for network survivability analysis that simplifies complex networks into smaller topologies to reduce computational complexity, aiding early-stage network design against adverse events.
Contribution
The paper presents a novel algorithm that maps complex networks onto simpler topologies to improve efficiency in survivability analysis.
Findings
Reduces computational complexity of survivability analysis
Enables analysis of larger, more complex networks
Discusses methods for further optimization
Abstract
In Nature, the primary goal of any network is to survive. This is less obvious for engineering networks (electric power, gas, water, transportation systems etc.) that are expected to operate under normal conditions most of time. As a result, the ability of a network to withstand massive sudden damage caused by adverse events (or survivability) has not been among traditional goals in the network design. Reality, however, calls for the adjustment of design priorities. As modern networks develop toward increasing their size, complexity, and integration, the likelihood of adverse events increases too due to technological development, climate change, and activities in the political arena among other factors. Under such circumstances, a network failure has an unprecedented effect on lives and economy. To mitigate the impact of adverse events on the network operability, the survivability…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
