Deterministic message routing in faulty hypercubes

DOI10.1007/3-540-53832-1_40MaRDI QIDQ4028113zbMATH OpenFDO

Authors Seshu Madhavapeddy, I. H. Sudborough

Publication date 28 March 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53832-1_40

zbMATH Keywords

faulty hypercubesrouting

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Routing in hypercube networks with a constant fraction of faulty nodes
• A fault-tolerant routing strategy in hypercube multicomputers
• Analysis of minimal path routing schemes in the presence of faults
• Fault-tolerant permutation routing in hypercubes
• A note on optimal time broadcast in faulty hypercubes

Cited in

(9)

• Analysis of minimal path routing schemes in the presence of faults
• On fault-tolerant fixed routing in hypercubes
• On the total\(_k\)-diameter of connection networks
• A fault-tolerant message passing algorithm and its hardware implementation
• Fault-tolerant permutation routing in hypercubes
• Routing in hypercube networks with a constant fraction of faulty nodes
• On the computational complexity of routing in faulty k-ary n-cubes and hypercubes
• Space-efficient and fault-tolerant message routing in outerplanar networks
• A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices

This page was built for publication: Deterministic message routing in faulty hypercubes

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