On the conditional diagnosability of matching composition networks

DOI10.1016/J.TCS.2014.09.008zbMath1338.68028OpenAlexW2012753472MaRDI QIDQ300261

Eddie Cheng, Ke Qiu, Zhizhang Shen

Publication date: 27 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.09.008

zbMATH Keywords

fault diagnosisconditional diagnosabilitycomparison diagnosis modelmatching composition networksself-diagnosable system

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (13)

Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks ⋮ Conditional diagnosability of the round matching composition networks ⋮ Strong diagnosability and conditional diagnosability of optical multi-mesh hypercube networks under the PMC model ⋮ On conditional fault tolerance and diagnosability of hierarchical cubic networks ⋮ Conditional diagnosability of bubble-sort star graphs ⋮ Edge-fault-tolerant strong Menger edge connectivity on regular graphs ⋮ The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model ⋮ Length two path centered surface areas of the \((n, k)\)-star graph ⋮ The \(g\)-good-neighbor conditional diagnosability of star graphs under the PMC and MM* model ⋮ Structural Properties of Generalized Exchanged Hypercubes ⋮ Theg-extra conditional diagnosability and sequentialt/k-diagnosability of hypercubes ⋮ The \(g\)-good neighbor conditional diagnosability of twisted hypercubes under the PMC and MM* model ⋮ Conditional diagnosability of the \(\mathit{SP}_n\) graphs under the comparison diagnosis model

Cites Work

• The conditional fault diagnosability of \((n, k)\)-star graphs
• On deriving conditional diagnosability of interconnection networks
• Conditional diagnosability of alternating group networks
• A general technique to establish the asymptotic conditional diagnosability of interconnection networks
• Linearly many faults in dual-cube-like networks
• Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model
• Linearly many faults in Cayley graphs generated by transposition trees
• Component connectivity of the hypercubes
• LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS
• Linearly many faults in 2-tree-generated networks
• On the maximal connected component of a hypercube with faulty vertices III
• Efficient Fault Identification of Diagnosable Systems under the Comparison Model
• Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model
• On the maximal connected component of hypercube with faulty vertices (II)
• On the maximal connected component of hypercube with faulty vertices
• Strongly Diagnosable Systems under the Comparison Diagnosis Model
• The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model
• Strong Diagnosability and Conditional Diagnosability of Multiprocessor Systems and Folded Hypercubes
• On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
• Optimization of Reduced Dependencies for Synchronous Sequential Machines

This page was built for publication: On the conditional diagnosability of matching composition networks