An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges

DOI10.1016/J.TCS.2011.02.014zbMath1216.68055OpenAlexW2010601119WikidataQ60402408 ScholiaQ60402408MaRDI QIDQ551165

Baolei Cheng, Jianxi Fan, Jia Yu, Xiao-Hua Jia

Publication date: 14 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.014

zbMATH Keywords

conditional connectivityfault-free pathbijective connection network

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (17)

On the \(t/k\)-diagnosability of BC networks ⋮ Paths and cycles identifying vertices in twisted cubes ⋮ The minimum spectral radius of an edge-removed network: a hypercube perspective ⋮ Disjoint path covers with path length constraints in restricted hypercube-like graphs ⋮ An algorithm to construct independent spanning trees on parity cubes ⋮ Path and cycle fault tolerance of bubble-sort graph networks ⋮ An efficient algorithm to construct disjoint path covers of DCell networks ⋮ A fast fault-identification algorithm for bijective connection graphs using the PMC model ⋮ Independent spanning trees on twisted cubes ⋮ Hamiltonian properties of honeycomb meshes ⋮ A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices ⋮ A Hypercube Variant with Small Diameter ⋮ Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs ⋮ Conditional Fault Tolerance of Hypermesh Optical Interconnection Networks ⋮ A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks ⋮ The restricted \(h\)-connectivity of the data center network DCell ⋮ Structure fault tolerance of WK-recursive networks

Cites Work

• Unnamed Item
• Fault-tolerant cycle embedding in the hypercube
• Efficient unicast in bijective connection networks with the restricted faulty node set
• Fault-tolerant Hamiltonicity of twisted cubes
• Longest fault-free paths in hypercubes with vertex faults
• Path bipancyclicity of hypercubes
• Node-pancyclicity and edge-pancyclicity of hypercube variants
• Edge-bipancyclicity of a hypercube with faulty vertices and edges
• Fault-tolerant embedding of paths in crossed cubes
• Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
• Conditional edge-fault Hamiltonicity of augmented cubes
• Path embedding in faulty hypercubes
• Locally twisted cubes are 4-pancyclic.
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• Conditional connectivity
• The Mobius cubes
• Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model
• The locally twisted cubes

This page was built for publication: An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges