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
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes
IEEE Transactions on Computers
The Cost of Broadcasting on Star Graphs and k-ary Hypercubes
IEEE Transactions on Computers
Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus 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
Fault-Tolerant Communication Algorithms in Toroidal Networks
IEEE Transactions on Parallel and Distributed Systems
Minimal Fault Diameter for Highly Resilient Product Networks
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant Hamiltonicity of twisted cubes
Journal of Parallel and Distributed Computing
A Parallel Algorithm for Lagrange Interpolation on k-ary n-Cubes
ParNum '99 Proceedings of the 4th International ACPC Conference Including Special Tracks on Parallel Numerics and Parallel Computing in Image Processing, Video Processing, and Multimedia: Parallel Computation
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Optimal all-ports collective communication algorithms for the k-ary n-cube interconnection networks
Journal of Systems Architecture: the EUROMICRO Journal
Optical transpose k-ary n-cube networks
Journal of Systems Architecture: the EUROMICRO Journal
Conditional fault-tolerant hamiltonicity of star graphs
Parallel Computing
Panconnectivity and edge-pancyclicity of 3-ary N-cubes
The Journal of Supercomputing
A unified fault-tolerant routing scheme for a class of cluster networks
Journal of Systems Architecture: the EUROMICRO Journal
Parallel Lagrange interpolation on k-ary n-cubes with maximum channel utilization
The Journal of Supercomputing
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
Theoretical Computer Science
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
Theoretical Computer Science
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
Information Sciences: an International Journal
Fault-free longest paths in star networks with conditional link faults
Theoretical Computer Science
Resource placement in three-dimensional tori
Parallel Computing
Upper bounds on the queuenumber of k-ary n-cubes
Information Processing Letters
A fault-tolerant communication scheme for regular cluster networks
CIIT '07 The Sixth IASTED International Conference on Communications, Internet, and Information Technology
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
Fault-tolerant mapping of a mesh network in a flexible hypercube
WSEAS Transactions on Computers
Fault-tolerant meshes and tori embedded in a faulty supercube
WSEAS Transactions on Computers
Construction of vertex-disjoint paths in alternating group networks
The Journal of Supercomputing
WSEAS Transactions on Information Science and Applications
On fault-tolerant embedding of meshes and tori in a flexible hypercube with unbounded expansion
WSEAS TRANSACTIONS on SYSTEMS
One-to-one disjoint path covers on k-ary n-cubes
Theoretical Computer Science
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
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
Theoretical Computer Science
Enhanced OTIS k-ary n-cube networks
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Extraconnectivity of k-ary n-cube networks
Theoretical Computer Science
Mathematical and Computer Modelling: An International Journal
Conditional Diagnosability of k-Ary n-Cubes under the PMC Model
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 0.01 |
We obtain the fault diameter of k-ary n-cube interconnection networks (also known as n-dimensional k-torus networks). We start by constructing a complete set of node-disjoint paths (i.e., as many paths as the degree) between any two nodes of a k-ary n-cube. Each of the obtained paths is of length zero, two, or four plus the minimum length except for one path in a special case (when the Hamming distance between the two nodes is one) where the increase over the minimum length may attain eight. These results improve those obtained in [8] where the length of some of the paths has a variable increase (which can be arbitrarily large) over the minimum length. These results are then used to derive the fault diameter of the k-ary n-cube, which is shown to be 驴 + 1 where 驴 is the fault free diameter.