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
The SGI Origin: a ccNUMA highly scalable server
Proceedings of the 24th annual international symposium on Computer architecture
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
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
Long paths in hypercubes with conditional node-faults
Information Sciences: an International Journal
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
Paper: Performance of the Intel iPSC/860 and Ncube 6400 hypercubes
Parallel Computing
Embedding meshes into locally twisted cubes
Information Sciences: an International Journal
The spined cube: A new hypercube variant with smaller diameter
Information Processing Letters
Theoretical Computer Science
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
Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
Theoretical Computer Science
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
Journal of Parallel and Distributed Computing
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 | 0.07 |
The connectivity is an important criteria to measure the fault-tolerant performance of a graph. However, the connectivity based on the condition of the set of arbitrary faulty nodes is generally lower. In this paper, in order to heighten this measure, we introduce the restricted connectivity into bijective connection networks. First, we prove that the probability that all the neighbors of an arbitrary node becomes faulty in any n-dimensional bijective connection network X"n is very low when n becomes sufficient large. Then, we give a constructive proof that under the condition that each node of an n-dimensional bijective connection network X"n has at least one fault-free neighbor, its restricted connectivity is 2n-2, about half of the connectivity of X"n. Finally, by our constructive proof, we give an O(n) algorithm to get a reliable path of length at most n+3@?log"2|F|@?+1 between any two fault-free nodes in an n-dimensional bijective connection network. In particular, since the family of BC networks contains hypercubes, crossed cubes, Mobius cubes, etc., our algorithm is appropriate for these cubes.