On fault-tolerant fixed routing in hypercubes

DOI10.1016/0020-0190(94)00075-1MaRDI QIDQ1332767zbMATH OpenOpenAlexFDO

Authors Abhijit Sengupta, Suresh Viswanathan

Publication date 5 September 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(94)00075-1

zbMATH Keywords

survival route graphs of hypercubes

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• New results in graph routing
• Routing in hypercube networks with a constant fraction of faulty nodes
• Longest fault-free paths in hypercubes with vertex faults
• Restricted fault diameter of hypercube networks

Cites work

• A new look at fault-tolerant network routing
• Combinatorial analysis of the fault-diameter of the n-cube
• Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs
• Efficient fault-tolerant routings in networks
• Fault-tolerant routings in a -connected network
• Fault-tolerant routings in Kautz and de Bruijn networks
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 139788 (Why is no real title available?)
• scientific article; zbMATH DE number 922877 (Why is no real title available?)
• On fault tolerant routings in general networks

Cited in

(13)

• Analysis of minimal path routing schemes in the presence of faults
• Restricted fault diameter of hypercube networks
• Fault-tolerant permutation routing in hypercubes
• Fault tolerant routing in the star and pancake interconnection networks
• Efficient connectivity testing of hypercubic networks with faults
• scientific article; zbMATH DE number 1555951 (Why is no real title available?)
• scientific article; zbMATH DE number 6863762 (Why is no real title available?)
• A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
• Finding a fault tolerant routing on neighbour-faulty hypercube
• Fault-tolerant routing in hypercubes using probability vectors
• Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs
• Fault-tolerant fixed routing in hypercube generalizations
• Deadlock-free routing in k-ary hypercube network in presence of processor failures

This page was built for publication: On fault-tolerant fixed routing in hypercubes

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