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

DOI10.1016/J.INS.2010.12.011MaRDI QIDQ545351zbMATHOpenAlexWikidataFDO

Authors Jianxi Fan, Shukui Zhang, Jia Yu, Xin Liu, X.-H. 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)

Recommendations

• An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
• Linearly Many Edge-Faults in 2-Bijective Connection Networks
• A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
• One-to-one communication in twisted cubes under restricted connectivity
• Reliability analysis of bijective connection networks in terms of the extra edge-connectivity

Cites work

• Conditional connectivity
• Edge-bipancyclicity of a hypercube with faulty vertices and edges
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• Embedding meshes into locally twisted cubes
• Fault tolerance of Möbius cubes under two forbidden fault set models
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
• Fault-tolerant Hamiltonicity of twisted cubes
• Fault-tolerant cycle embedding in the hypercube
• Fault-tolerant embedding of paths in crossed cubes
• Locally twisted cubes are 4-pancyclic.
• Long paths in hypercubes with conditional node-faults
• Longest fault-free paths in hypercubes with vertex faults
• Node-pancyclicity and edge-pancyclicity of hypercube variants
• On super and restricted connectivity of some interconnection networks.
• Path bipancyclicity of hypercubes
• Path embedding in faulty hypercubes
• The Mobius cubes
• The locally twisted cubes

Cited in

(25)

• A hypercube variant with small diameter
• Two-round diagnosability measures for multiprocessor systems
• Hamiltonian properties of honeycomb meshes
• On the \(t/k\)-diagnosability of BC networks
• Constructing completely independent spanning trees in crossed cubes
• An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
• Conditional Fault Tolerance of Hypermesh Optical Interconnection Networks
• The minimum spectral radius of an edge-removed network: a hypercube perspective
• Independent spanning trees on twisted cubes
• The spined cube: a new hypercube variant with smaller diameter
• An efficient algorithm to construct disjoint path covers of DCell networks
• An algorithm to construct independent spanning trees on parity cubes
• A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks
• A fast fault-identification algorithm for bijective connection graphs using the PMC model
• Disjoint path covers with path length constraints in restricted hypercube-like graphs
• Path and cycle fault tolerance of bubble-sort graph networks
• The strong local diagnosability of a hypercube network with missing edges
• A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
• One-to-one disjoint path covers on alternating group graphs
• Reliability of \(m\)-ary \(n\)-dimensional hypercubes under embedded restriction
• The restricted \(h\)-connectivity of the data center network DCell
• Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
• Paths and cycles identifying vertices in twisted cubes
• The congestion of generalized cube communication pattern in linear array network
• Changing the diameter of the locally twisted cube

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

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