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

TL;DR

This work introduces Fast-MCS, an open-source, scalable tool for evaluating MCSs in large, complex networks, and compares the computation time of Fast-MCS with the state-of-the-art.

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.

Figures (8)

• Figure 1: Germany_17 topology sndlib
• Figure 2: Combinatorial procedure to evaluate MCS.
• Figure 3: Example topology, source-destination pair, and its corresponding MPS.
• Figure 4: Fast-MCS's algorithm illustrated with the example source-destination pair, $S-T$, in Fig. \ref{['fig:topo']}.
• Figure 5: Workflow adopted in this work.