A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Algorithmic graph theory
Diagnosabilities of Hypercubes Under the Pessimistic One-Step Diagnosis Strategy
IEEE Transactions on Computers
Product-shuffle networks: toward reconciling shuffles and butterflies
Discrete Applied Mathematics - Special double volume: interconnection networks
On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach
IEEE Transactions on Computers
Folded Petersen Cube Networks: New Competitors for the Hypercubes
IEEE Transactions on Parallel and Distributed Systems
The Cross Product of Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Diagnosability of Hypercubes and Enhanced Hypercubes under the Comparison Diagnosis Model
IEEE Transactions on Computers
Minimal Fault Diameter for Highly Resilient Product Networks
IEEE Transactions on Parallel and Distributed Systems
Diagnosability of Enhanced Hypercubes
IEEE Transactions on Computers
Lee Distance and Topological Properties of k-ary n-cubes
IEEE Transactions on Computers
Products of Networks with Logarithmic Diameter and Fixed Degree
IEEE Transactions on Parallel and Distributed Systems
Diagnosability of Crossed Cubes under the Comparison Diagnosis Model
IEEE Transactions on Parallel and Distributed Systems
Design and analysis of product networks
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
A comparison connection assignment for diagnosis of multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
The diagnosability of the matching composition network under the comparison diagnosis model
IEEE Transactions on Computers
(t,k)-Diagnosis for Matching Composition Networks
IEEE Transactions on Computers
Minimum neighborhood in a generalized cube
Information Processing Letters
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model
IEEE Transactions on Computers
Strong diagnosability of regular networks under the comparison model
Information Processing Letters
A survey of comparison-based system-level diagnosis
ACM Computing Surveys (CSUR)
Determining the conditional diagnosability of k-ary n-cubes under the MM* model
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
| Hi-index | 14.99 |
Diagnosability is an important factor in measuring the reliability of an interconnection network, while the (node) connectivity is used to measure the fault tolerance of an interconnection network. We observe that there is a close relationship between the connectivity and the diagnosability. According to our results, a t-regular and t-connected network with at least 2t + 3 nodes is t--diagnosable. Furthermore, the diagnosability of the product networks is also investigated in this work. The product networks, including hypercube, mesh, and tori, comprise very important classes of interconnection networks. Herein, different combinations of t--diagnosable and t-connected are employed to study the diagnosability of the product networks.