Fast-MCS: A Scalable Open-Source Tool to Find Minimal Cut Sets

TL;DR

Fast-MCS is an open-source, scalable tool designed to efficiently identify minimal cut sets in large networks, aiding in understanding critical failure points.

Contribution

The paper introduces Fast-MCS, a new scalable tool for computing minimal cut sets, with performance comparisons to existing methods.

Findings

Fast-MCS significantly reduces computation time for large networks.

Fast-MCS outperforms existing state-of-the-art tools in efficiency.

The tool is open-source and suitable for complex network analysis.

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.