Disjoint-paths and fault-tolerant routing on recursive dual-net

DOI10.1142/S0129054111008532MaRDI QIDQ3173931zbMATHFDO

Authors Shietung Peng, Wanming Chu, Ya-Min Li

Publication date 10 October 2011

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

interconnection networkdisjoint pathsfault-tolerant routing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Recommendations

• Computational and Information Science
• Construction of large‐size interconnection networks with high performance
• scientific article; zbMATH DE number 1728437
• Efficient fault-tolerant routings in networks
• Linearly many faults in dual-cube-like networks

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 596177 (Why is no real title available?)
• Efficient collective communications in dual-cube

Cited in

(8)

• Fractional routing using pairs of failure-disjoint paths
• Conditional Fault Tolerance of Hypermesh Optical Interconnection Networks
• Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners
• Set-to-set disjoint paths in a folded hypercube
• Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
• Node-disjoint paths in incomplete WK-recursive networks
• Hamiltonicity of the torus network under the conditional fault model
• The super spanning connectivity and super spanning laceability of tori with faulty elements

This page was built for publication: Disjoint-paths and fault-tolerant routing on recursive dual-net

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