Evaluating robustness of subnetworks for the split-star network

Document Type

Article

Publication Date

1-1-2025

Journal / Book Title

IEEE Transactions on Computers

Abstract

The robustness of subnetworks for the interconnection network of a computer system is an important consideration for the system performance. It can be measured by the extent to which subnetworks can stay fault-free when faults are present in the system. In this paper, we evaluate the subnetwork robustness for the n-dimensional split-star network Sn2. Let Sn-m2, 1 ≤ m ≤ n-3 , be a subnetwork of Sn2, and let p be the node reliability, the probability that a single node remains fault-free. We determine two values that reflect how robust Sn-m2 subnetworks are, from two perspectives. We first establish the upper/lower bounds for Fm (Sn2), the minimum number of faulty nodes to make all Sn-m2 subnetworks faulty. Then, we determine the subnetwork reliability, denoted by Rm (Sn2, p), which is the probability that at least one fault-free Sn-m2 subnetwork exists in Sn2, given the node reliability p. The upper/lower bounds and an approximation expression for Rm (Sn2, p) are obtained. We also propose a simulation method to estimate Rm (Sn2, p). The experimental results show that a) when p is relatively low, Rm (Sn2, p) can be approximated by the mean value of its upper and lower bounds, or the estimation value by the approximation expression; b) when p is high, Rm (Sn2, p) can be more accurately estimated by our simulation method.

DOI

10.1109/TC.2025.3584558

Journal ISSN / Book ISBN

105009610508 (Scopus)

This document is currently not available here.

Link to Publisher
Link at MSU

Share

COinS