The pessimistic diagnosability of data center networks
From MaRDI portal
Publication:1707979
DOI10.1016/j.ipl.2018.02.009zbMath1471.68037OpenAlexW2789710210MaRDI QIDQ1707979
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
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (6)
On the conjecture of vertex-transitivity of DCell ⋮ Conditional edge-fault-tolerant Hamiltonicity of the data center network ⋮ Reliability evaluation of complete graph-based recursive networks ⋮ A note on the strong matching preclusion problem for data center networks ⋮ The vertex-pancyclicity of data center networks ⋮ Constructing dual-CISTs of DCell data center networks
Cites Work
- The restricted \(h\)-connectivity of the data center network DCell
- 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 thek-aryn-cubes using the pessimistic strategy
- The $t/k$-Diagnosability of Star Graph Networks
- On Fault Identification in Diagnosable Systems
- Characterization of Connection Assignment of Diagnosable Systems
- Theory and Application of Graphs
- A Quick Pessimistic Diagnosis Algorithm for Hypercube-Like Multiprocessor Systems under the PMC Model
- 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
This page was built for publication: The pessimistic diagnosability of data center networks
