Fault-tolerant routing in hypercubes using probability vectors
From MaRDI portal
Recommendations
- Probability-based fault-tolerant routing in hypercubes
- On fault-tolerant fixed routing in hypercubes
- Fault-tolerant fixed routing in hypercube generalizations
- Routing in hypercube networks with a constant fraction of faulty nodes
- scientific article; zbMATH DE number 2114009
- Fault-tolerant permutation routing in hypercubes
- Finding a fault tolerant routing on neighbour-faulty hypercube
Cited in
(11)- Fault-tolerant permutation routing in hypercubes
- The Josephus Cube: analysis of routing and fault tolerance
- Reliable unicasting in faulty hypercube multicomputers based on local safety information
- Probability-based fault-tolerant routing in hypercubes
- A Performance Guaranteed New Algorithm for Fault-Tolerant Routing in Folded Cubes
- scientific article; zbMATH DE number 6863762 (Why is no real title available?)
- scientific article; zbMATH DE number 2112164 (Why is no real title available?)
- scientific article; zbMATH DE number 2114009 (Why is no real title available?)
- Fractional routing using pairs of failure-disjoint paths
- A NEW FAULT-TOLERANT ROUTING ALGORITHM FOR k-ARY n-CUBE NETWORKS
- Improved fault-tolerance sorting algorithm in hypercubes
This page was built for publication: Fault-tolerant routing in hypercubes using probability vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941495)