On the \(t/k\)-diagnosability of BC networks

DOI10.1016/J.AMC.2013.09.063zbMath1334.68031OpenAlexW2005735542MaRDI QIDQ275756

Chengfu Qin, Huiqiu Lin, Weihua Yang

Publication date: 26 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2013.09.063

zbMATH Keywords

reliabilityfault tolerancePMC diagnosis model\(t/k\)-diagnosabilityBC networks

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (12)

The \(t/s\)-diagnosability and \(t/s\)-diagnosis algorithm of folded hypercube under the PMC/MM* model ⋮ The strong local diagnosability of a hypercube network with missing edges ⋮ Reliability Evaluation of Generalized Exchanged Hypercubes Based on Imprecise Diagnosis Strategies ⋮ Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity ⋮ The \(t/m\)-diagnosis strategy of augmented \(k\)-ary \(n\)-cubes ⋮ Reliability of \((n,k)\)-star network based on \(g\)-extra conditional fault ⋮ The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell ⋮ A note on minimum linear arrangement for BC graphs ⋮ Theg-extra conditional diagnosability and sequentialt/k-diagnosability of hypercubes ⋮ The \(t/k\)-diagnosability and strong Menger connectivity on star graphs with conditional faults ⋮ Two-round diagnosability measures for multiprocessor systems ⋮ The \(g\)-extra connectivity and diagnosability of crossed cubes

Cites Work

• A fast fault-identification algorithm for bijective connection graphs using the PMC model
• Efficient unicast in bijective connection networks with the restricted faulty node set
• An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
• A \((4n - 9)/3\) diagnosis algorithm on \(n\)-dimensional cube network
• Embedding of cycles in twisted cubes with edge-pancyclic
• A note about some properties of BC graphs
• Minimum neighborhood in a generalized cube
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• A lower bound on the size of \(k\)-neighborhood in generalized cubes
• Conditional diagnosability of balanced hypercubes under the PMC model
• An Approach to the Diagnosability Analysis of a System
• Characterization of Connection Assignment of Diagnosable Systems
• The Mobius cubes
• On diagnosability of large fault sets in regular topology-based computer systems
• Reliability Evaluation of BC Networks in Terms of the Extra Vertex- and Edge-Connectivity
• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• Algorithms and Computation

This page was built for publication: On the \(t/k\)-diagnosability of BC networks