On fault-tolerant fixed routing in hypercubes

DOI10.1016/0020-0190(94)00075-1zbMATH Open0821.68008OpenAlexW2080885019MaRDI QIDQ1332767FDOQ1332767

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

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

zbMATH Keywords

survival route graphs of hypercubes

Mathematics Subject Classification ID

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

Cites Work

• Efficient fault-tolerant routings in networks
• Title not available (Why is that?)
• Fault-tolerant routings in a \(\kappa\)-connected network
• Combinatorial analysis of the fault-diameter of the n-cube
• On fault tolerant routings in general networks
• A new look at fault-tolerant network routing
• Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs
• Fault-tolerant routings in Kautz and de Bruijn networks
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (13)

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

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)