Enhancing Reliability of Folded Petersen Networks Based on Edge Partition

The rapid expansion of infrastructure topology, especially noticeable in high-performance computing systems and data center networks, significantly increases the likelihood of failures in network components. While traditional (edge) connectivity has long been the standard for measuring the reliability of interconnection networks, this approach becomes less effective as networks grow more complex. To address this, two innovative metrics, named matroidal connectivity and conditional matroidal connectivity, have emerged. These metrics provide the flexibility to impose constraints on faulty edges across different dimensions and have shown promise in enhancing the edge fault tolerance of interconnection networks. In this paper, we explore (conditional) matroidal connectivity of the [Formula: see text]-dimensional folded Petersen network [Formula: see text], which is constructed by iteratively applying the Cartesian product operation on the well-known Petersen graph and possesses a regular, vertex- and edge-symmetric architecture with optimal connectivity and logarithmic diameter. Specifically, the faulty edge set [Formula: see text] is partitioned into [Formula: see text] subsets according to the dimensions of [Formula: see text]. We then arrange these subsets by their cardinality, imposing the restriction whereby the cardinality of the [Formula: see text]th largest subset dose not exceed [Formula: see text] for [Formula: see text]. Subsequently, we show that [Formula: see text] is connected with [Formula: see text] and determine the exact value of matroidal connectivity and conditional matroidal connectivity.