A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
From MaRDI portal
Recommendations
- Efficient unicast in bijective connection networks with the restricted faulty node set
- Fault-tolerant fixed routing in hypercube generalizations
- On fault-tolerant fixed routing in hypercubes
- Reliable unicasting in faulty hypercube multicomputers based on local safety information
- On optimal broadcasting in faulty hypercubes
- Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges.
- scientific article; zbMATH DE number 139788
Cites work
- \(\{2,3\}\)-restricted connectivity of locally twisted cubes
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
- Combinatorial properties of generalized hypercube graphs
- Conditional connectivity
- Efficient unicast in bijective connection networks with the restricted faulty node set
- Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- On restricted connectivity and extra connectivity of hypercubes and folded hypercubes
- One-to-one communication in twisted cubes under restricted connectivity
- The existence and upper bound for two types of restricted connectivity
- The restricted h-connectivity of the data center network DCell
Cited in
(5)- The \(h\)-restricted connectivity of the generalized hypercubes
- Efficient unicast in bijective connection networks with the restricted faulty node set
- Communication Performance Evaluation of the Locally Twisted Cube
- Reliability evaluation for a class of recursive match networks
- Super spanning connectivity of the generalized hypercube network
This page was built for publication: A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639925)