The properties and t/s-diagnosability of k-ary n-cube networks

• Published in: The Journal of supercomputing Vol. 78; no. 5; pp. 7038 - 7057
• Main Authors: Xie, Yuhao, Liang, Jiarong, Yin, Wen, Li, Changzhen
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.04.2022; Springer Nature B.V
• Subjects: Compilers; Computer Science; Cubes; Interpreters; Nodes; Processor Architectures; Programming Languages; Strategy; PMC model; diagnosis strategy; cubes; ary; Fault node identification; Diagnosis model; /
• ISSN: 0920-8542; 1573-0484
• DOI: 10.1007/s11227-021-04155-y

An increase in network system size increases the risk of node failure in a system. To maintain the reliability of the system, the faulty nodes need to be repaired or replaced with additional nodes, which implies that the approach of locating the faulty nodes in the system is a research topic of great significance. There are various kinds of diagnosis strategies, such as the t -diagnosis strategy, t / s -diagnosis strategy, t / t -diagnosis strategy and t / k -diagnosis strategy. When we use the t / s -diagnosis strategy to identify faulty nodes, some fault-free nodes may be identified as faulty nodes. In addition, the choice of the specific diagnosis model to identify faulty nodes is important; the Preparata, Metze and Chen (PMC) model is widely used. In this paper, we study the t / s -diagnosability of the k -ary n -cube under the PMC model. First, we obtain several structural properties of k -ary n -cubes. Then, we use these properties and determine that the 3-ary n -cube is η / η + h - 1 -diagnosable, where n ⩾ 2 , 1 ⩽ h ⩽ n - 1 and 2 h n - 3 ( h - 1 ) - ( h - 1 ) ( h - 2 ) 2 - 1 < η ⩽ 2 ( h + 1 ) n - 3 h - h ( h - 1 ) 2 - 1 , and that the k -ary n -cube is η / η + h - 1 -diagnosable, where k ⩾ 4 , n ⩾ 2 , 1 ⩽ h ⩽ n - 1 and 2 h n - 2 ( h - 1 ) - ( h - 1 ) ( h - 2 ) 2 - 1 < η ⩽ 2 ( h + 1 ) n - 2 h - h ( h - 1 ) 2 - 1 .