Fault diameter of interconnection networks
Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
Topological Properties of Hypercubes
IEEE Transactions on Computers
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Product-shuffle networks: toward reconciling shuffles and butterflies
Discrete Applied Mathematics - Special double volume: interconnection networks
On the fault-diameter of the star graph
Information Processing Letters
Folded Petersen Cube Networks: New Competitors for the Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Mesh-Connected Trees: A Bridge Between Grids and Meshes of Trees
IEEE Transactions on Parallel and Distributed Systems
The Cross Product of Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Fault Diameter of k-ary n-cube Networks
IEEE Transactions on Parallel and Distributed Systems
Combinatorial Analysis of the Fault-Diameter of the N-Cube
IEEE Transactions on Computers
Lee Distance and Topological Properties of k-ary n-cubes
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
The Hyper-deBruijn Networks: Scalable Versatile Architecture
IEEE Transactions on Parallel and Distributed Systems
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Products of Networks with Logarithmic Diameter and Fixed Degree
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)
Diagnosability of t-Connected Networks and Product Networks under the Comparison Diagnosis Model
IEEE Transactions on Computers
Performance, Algorithmic, and Robustness Attributes of Perfect Difference Networks
IEEE Transactions on Parallel and Distributed Systems
Fault-diameter of Cartesian graph bundles
Information Processing Letters
Capturing an intruder in product networks
Journal of Parallel and Distributed Computing
The edge fault-diameter of Cartesian graph bundles
European Journal of Combinatorics
Resource placement in Cartesian product of networks
Journal of Parallel and Distributed Computing
Edge fault-diameter of Cartesian product of graphs
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Fault diameters of graph products and bundles
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
Capturing an intruder in product networks
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Mixed fault diameter of Cartesian graph bundles
Discrete Applied Mathematics
| Hi-index | 0.00 |
We present a number of results related to the fault tolerance of Cartesian product networks. We start by presenting a method for building containers (i.e., sets of node-disjoint paths) between any two nodes of a product network based on given containers for the factor networks. Then, we show that the best achievable fault diameter (i.e., diameter under maximum fault conditions), under reasonable network regularity and connectivity conditions, is equal to the fault-free diameter plus one. The concept of high fault resilience is then defined. We then prove that if each factor network is highly resilient, then their Cartesian product has minimal fault diameter. We derive from these results that Cartesian products of several popular networks are highly resilient and have minimal fault diameter equal to diameter plus one. These results spare future efforts that would be needed to individually determine the fault diameter of such networks as has been the practice with previously studied networks.