Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
The twisted cube topology for multiprocessors: a study in network asymmetry
Journal of Parallel and Distributed Computing
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
Unicast in Hypercubes with Large Number of Faulty Nodes
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant Hamiltonicity of twisted cubes
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
Fault-tolerant cycle embedding in the hypercube
Parallel Computing
Pancyclicity on Möbius cubes with maximal edge faults
Parallel Computing
The t/k-Diagnosability of the BC Graphs
IEEE Transactions on Computers
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Path bipancyclicity of hypercubes
Information Processing Letters
Node-pancyclicity and edge-pancyclicity of hypercube variants
Information Processing Letters
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Parallel Computing
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
IEEE Transactions on Parallel and Distributed Systems
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
Edge-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences: an International Journal
Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model
IEEE Transactions on Computers
Edge-bipancyclicity of a hypercube with faulty vertices and edges
Discrete Applied Mathematics
Fault-tolerant embedding of paths in crossed cubes
Theoretical Computer Science
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
Theoretical Computer Science
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Efficient unicast in bijective connection networks with the restricted faulty node set
Information Sciences: an International Journal
Independent spanning trees on twisted cubes
Journal of Parallel and Distributed Computing
A fast fault-identification algorithm for bijective connection graphs using the PMC model
Information Sciences: an International Journal
An algorithm to construct independent spanning trees on parity cubes
Theoretical Computer Science
Theoretical Computer Science
An energy- and buffer-aware fully adaptive routing algorithm for Network-on-Chip
Microelectronics Journal
Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
Theoretical Computer Science
Hamiltonian properties of honeycomb meshes
Information Sciences: an International Journal
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes
The Journal of Supercomputing
Hi-index | 5.23 |
In this paper, we study fault-tolerant routing in bijective connection networks with restricted faulty edges. First, we prove that the probability that all the incident edges of an arbitrary node become faulty in an n-dimensional bijective connection network, denoted by X"n, is extremely low when n becomes sufficient large. Then, we give an O(n) algorithm to find a fault-free path of length at most n+3@?log"2|F|@?+1 between any two different nodes in X"n if each node of X"n has at least one fault-free incident edge and the number of faulty edges is not more than 2n-3. In fact, we also for the first time provide an upper bound of the fault diameter of all the bijective connection networks with the restricted faulty edges. Since the family of BC networks contains hypercubes, crossed cubes, Mobius cubes, etc., all the results are appropriate for these cubes.