Fast-MCS: A Scalable Open-Source Tool to Find Minimal Cut Sets
Preprint
Abstract
A network is represented as a graph consisting of nodes and edges. A cut set for a source-destination pair in a network is a set of elements that, when failed, cause the source-destination pair to lose connectivity. A Minimal Cut Set (MCS) is a cut set that cannot be further reduced while maintaining its status as a cut set. MCSs are crucial in identifying the critical elements in the network that have the most significant impact on failure. This work introduces Fast-MCS, an open-source, scalable tool for evaluating MCSs in large, complex networks. Additionally, we compare the computation time of Fast-MCS with the state-of-the-art.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- PyRBD: An Open-Source Reliability Block Diagram Evaluation Tool2024
- New and Fast Algorithm to Minimal Cutsets Enumeration Based on Necessary Minimal Paths2018
- Fault tree analysis: A survey of the state-of-the-art in modeling, analysis and toolsComputer Science Review, 2015
- The Internet Topology ZooIEEE Journal on Selected Areas in Communications, 2011
- SNDlib 1.0—Survivable Network Design LibraryNetworks, 2009
- A simple algorithm to search for all MCs in networksEuropean Journal of Operational Research, 2006
- Mathematical foundations of minimal cutsetsIEEE Transactions on Reliability, 2001
- A heuristic technique for generating minimal path and cutsets of a general networkComputers & Industrial Engineering, 1999
- Generation of vertex and edge cutsetsMicroelectronics Reliability, 1992
- Finding minimal cut sets in a fault treeReliability Engineering & System Safety, 1992