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

DOI10.1142/S0129054111008532zbMATH Open1222.68044MaRDI QIDQ3173931FDOQ3173931

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)

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

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)

Cites Work

• Title not available (Why is that?)
• Efficient collective communications in dual-cube
• Title not available (Why is that?)

Cited In (8)

• Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners
• Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements
• Conditional Fault Tolerance of Hypermesh Optical Interconnection Networks
• Node-disjoint paths in incomplete WK-recursive networks
• The super spanning connectivity and super spanning laceability of tori with faulty elements
• Fractional routing using pairs of failure-disjoint paths
• Set-to-set disjoint paths in a folded hypercube
• Hamiltonicity of the torus network under the conditional fault model

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)