The diagnosability of thek-aryn-cubes using the pessimistic strategy

DOI10.1080/00207160.2011.628386zbMath1237.68032OpenAlexW2122816430MaRDI QIDQ2887017

Ruitao Feng, Qiang Zhu, Xinke Wang

Publication date: 15 May 2012

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2011.628386

zbMATH Keywords

interconnection networkstoriPMC model\(k\)-ary \(n\)-cubespessimistic strategy\(t_1\)/\(t_1\)-diagnosability

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (6)

Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs ⋮ Reliability evaluation of complete graph-based recursive networks ⋮ The \(t/k\)-diagnosability of \(m\)-ary \(n\)-cube networks ⋮ The pessimistic diagnosability of data center networks ⋮ The pessimistic diagnosability of three kinds of graphs ⋮ Reliability analysis of Cayley graphs generated by transpositions

Cites Work

• Unnamed Item
• On conditional diagnosability of the folded hypercubes
• On Fault Identification in Diagnosable Systems
• Diagnosability of enhanced hypercubes
• On diagnosability of large fault sets in regular topology-based computer systems
• Lee distance and topological properties of k-ary n-cubes
• Strongly Diagnosable Systems under the Comparison Diagnosis Model

This page was built for publication: The diagnosability of thek-aryn-cubes using the pessimistic strategy