Probability-based fault-tolerant routing in hypercubes

DOI10.1093/COMJNL/44.5.368MaRDI QIDQ2762724zbMATH OpenOpenAlexFDO

Authors J. Al-Sadi, K. Day, M. Ould-Khaoua

Publication date 27 February 2002

Published in The Computer Journal. Section A Section B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/44.5.368

zbMATH Keywords

fault-tolerant routing algorithmhypercube

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• A NEW FAULT-TOLERANT ROUTING ALGORITHM FOR k-ARY n-CUBE NETWORKS
• Fault-tolerant routing in hypercubes using probability vectors
• Reliable unicasting in faulty hypercube multicomputers based on local safety information
• Fault-tolerant permutation routing in hypercubes
• scientific article; zbMATH DE number 6863762

Cited in

(6)

• A genetic-based fault-tolerant routing strategy for multiprocessor networks
• On the Resiliency of Randomized Routing Against Multiple Edge Failures
• Fractional routing using pairs of failure-disjoint paths
• A NEW FAULT-TOLERANT ROUTING ALGORITHM FOR k-ARY n-CUBE NETWORKS
• Fault-tolerant routing in hypercubes using probability vectors
• Reliability analysis and fault tolerance for hypercube multi-computer networks

This page was built for publication: Probability-based fault-tolerant routing in hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2762724)