An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes

DOI10.1109/12.67315zbMath1395.68055OpenAlexW2129307244MaRDI QIDQ5375380

Daniel H. Linder, Jim C. Harden

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.67315

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (10)

Minimal fully adaptive wormhole routing on hypercubes ⋮ Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks ⋮ Optimal wavelength assignment in the implementation of parallel algorithms with ternary \(n\)-cube communication pattern on mesh optical network ⋮ Minimum-cost line broadcast in paths ⋮ The family of generalized variational network of cube-connected cycles ⋮ The \(t/k\)-diagnosability of \(m\)-ary \(n\)-cube networks ⋮ RVCCC: a new variational network of cube-connected cycles and its topological properties ⋮ Optimal routing in toroidal networks ⋮ Fault-tolerant wormhole routing for hypercube networks ⋮ A fault-tolerant wormhole routing scheme for torus networks with nonconvex faults

This page was built for publication: An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes