Efficient unicast in bijective connection networks with the restricted faulty node set

DOI10.1016/J.INS.2010.12.011zbMath1216.68056OpenAlexW2036896089WikidataQ60402434 ScholiaQ60402434MaRDI QIDQ545351

Jianxi Fan, Jia Yu, Shukui Zhang, Xin Liu, Xiao-Hua Jia

Publication date: 22 June 2011

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2010.12.011

zbMATH Keywords

connectivityfault-free pathset of restricted faulty nodesunicastbijective connection network

Mathematics Subject Classification ID

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

Related Items (25)

On the \(t/k\)-diagnosability of BC networks ⋮ The strong local diagnosability of a hypercube network with missing edges ⋮ Paths and cycles identifying vertices in twisted cubes ⋮ The minimum spectral radius of an edge-removed network: a hypercube perspective ⋮ THE CONGESTION OF GENERALIZED CUBE COMMUNICATION PATTERN IN LINEAR ARRAY NETWORK ⋮ 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 ⋮ Reliability of \(m\)-ary \(n\)-dimensional hypercubes under embedded restriction ⋮ The spined cube: a new hypercube variant with smaller diameter ⋮ Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes ⋮ A fast fault-identification algorithm for bijective connection graphs using the PMC model ⋮ One-to-one disjoint path covers on alternating group graphs ⋮ Independent spanning trees on twisted cubes ⋮ Hamiltonian properties of honeycomb meshes ⋮ A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices ⋮ Constructing completely independent spanning trees in crossed cubes ⋮ An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges ⋮ A Hypercube Variant with Small Diameter ⋮ Two-round diagnosability measures for multiprocessor systems ⋮ Changing the diameter of the locally twisted cube ⋮ 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

Cites Work

• Unnamed Item
• Fault-tolerant cycle embedding in the hypercube
• 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
• Path embedding in faulty hypercubes
• Embedding meshes into locally twisted cubes
• Long paths in hypercubes with conditional node-faults
• 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
• The locally twisted cubes
• Fault tolerance of Möbius cubes under two forbidden fault set models

This page was built for publication: Efficient unicast in bijective connection networks with the restricted faulty node set