A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks

DOI10.1016/j.tcs.2018.07.018zbMath1410.68060OpenAlexW2886785376WikidataQ129451790 ScholiaQ129451790MaRDI QIDQ1711835

Eddie Cheng, Zhizhang Shen, Ke Qiu

Publication date: 18 January 2019

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

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

zbMATH Keywords

distributed computingarrangement graph\(g\)-good-neighbor conditional diagnosability\((n, k)\)-star graph\(R_h\)-restricted connectivityfault tolerance property

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (10)

The upper and lower bounds of \(R_g\)-conditional diagnosability of networks ⋮ On the \(g\)-extra diagnosability of enhanced hypercubes ⋮ A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks ⋮ Reliability Evaluation of Bicube-Based Multiprocessor System under the g-Good-Neighbor Restriction ⋮ Restricted connectivity and good-neighbor diagnosability of split-star networks ⋮ \(r\)-component diagnosability of hypercubes under the PMC model ⋮ The non-inclusive diagnosability of regular graphs ⋮ On the \(g\)-extra connectivity of augmented cubes ⋮ The extra connectivity and extra diagnosability of regular interconnection networks ⋮ Characterization of component diagnosability of regular networks

Cites Work

• Unnamed Item
• The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM\(^\ast\) model
• Fault-tolerance of \((n, k)\)-star networks
• The \(g\)-good-neighbor conditional diagnosability of hypercube under PMC model
• On deriving conditional diagnosability of interconnection networks
• The \(g\)-good-neighbor conditional diagnosability of star graphs under the PMC and MM* model
• The \(g\)-good-neighbor diagnosability of \((n,k)\)-star graphs
• Weak-vertex-pancyclicity of (\(n,k\))-star graphs
• A kind of conditional vertex connectivity of star graphs
• Arrangement graphs: A class of generalized star graphs
• The \((n,k)\)-star graph: A generalized star graph
• A kind of conditional fault tolerance of \((n, k)\)-star graphs
• Conditional fault tolerance of arrangement graphs
• Fault tolerance in the arrangement graphs
• On the arrangement graph.
• An 0(n^2.5) Fault Identification Algorithm for Diagnosable Systems
• Conditional connectivity
• A group-theoretic model for symmetric interconnection networks
• Generalized measures for fault tolerance of star networks
• A new class of interconnection networks based on the alternating group
• Linearly many faults in arrangement graphs
• On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• The 1-good-neighbour diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model

This page was built for publication: A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks