The pessimistic diagnosability of data center networks

DOI10.1016/J.IPL.2018.02.009zbMATH Open1471.68037OpenAlexW2789710210MaRDI QIDQ1707979FDOQ1707979

Authors: Mei-Mei Gu, Jian-Bing Liu, Rong-Xia Hao 

Publication date: 4 April 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.02.009

Recommendations

• The pessimistic diagnosabilities of some general regular graphs
• The pessimistic diagnosability of three kinds of graphs
• Fault diagnosability of data center networks
• The pessimistic diagnosability of split-star networks under the PMC model
• The pessimistic diagnosability of alternating group graphs under the PMC model

zbMATH Keywords

fault-toleranceDCell networkinterconnection networksPMC modelpessimistic diagnosability

Mathematics Subject Classification ID

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

Cites Work

• The restricted \(h\)-connectivity of the data center network DCell
• Theory and Application of Graphs
• Conditional Diagnosability of Alternating Group Graphs
• Strong Diagnosability and Conditional Diagnosability of Multiprocessor Systems and Folded Hypercubes
• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• Characterization of Connection Assignment of Diagnosable Systems
• On Fault Identification in Diagnosable Systems
• A Quick Pessimistic Diagnosis Algorithm for Hypercube-Like Multiprocessor Systems under the PMC Model
• Fault isolation and identification in general biswapped networks under the PMC diagnostic model
• The pessimistic diagnosability of alternating group graphs under the PMC model
• The pessimistic diagnosabilities of some general regular graphs
• The diagnosability of the \(k\)-ary \(n\)-cubes using the pessimistic strategy
• The $t/k$-Diagnosability of Star Graph Networks

Cited In (9)

• Two-disjoint-cycle-cover pancyclicity of data center networks
• On the conjecture of vertex-transitivity of DCell
• Reliability evaluation of complete graph-based recursive networks
• The number of spanning trees for Sierpiński graphs and data center networks
• The vertex-pancyclicity of data center networks
• Constructing dual-CISTs of DCell data center networks
• High fault-tolerant performance of the divide-and-swap cube network
• Conditional edge-fault-tolerant Hamiltonicity of the data center network
• A note on the strong matching preclusion problem for data center networks

This page was built for publication: The pessimistic diagnosability of data center networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1707979)