Fault tolerance in k-ary n-cube networks

DOI10.1016/J.TCS.2012.06.013MaRDI QIDQ690475zbMATHOpenAlexFDO

Authors Guozhen Zhang, Kai Feng, Shiying Wang

Publication date 27 November 2012

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

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

zbMATH Keywords

fault toleranceinterconnection networks\(k\)-ary \(n\)-cubesnode-failure

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Recommendations

• The fault tolerance of \(k\)-ary \(n\)-cubes with respect to maximally local connectivity
• Subnetwork reliability analysis in \(k\)-ary \(n\)-cubes
• Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes
• Unchanging the diameter of \(k\)-ary \(n\)-cube networks with faulty vertices
• Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links

Cites work

• scientific article; zbMATH DE number 1242264 (Why is no real title available?)
• A note on edge fault tolerance with respect to hypercubes
• A study of fault tolerance in star graph
• Embedding longest fault-free paths onto star graphs with more vertex faults
• Fault tolerance in bubble-sort graph networks
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
• Fault-free longest paths in star networks with conditional link faults
• Fault-tolerant embedding of paths in crossed cubes
• Graph theory
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• How robust is the n-cube?
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements

Cited in

(25)

• Incomplete \(k\)-ary \(n\)-cube and its derivatives.
• A lower bound on the size of \(k\)-neighborhood in generalized cubes
• Structure fault tolerance of \(k\)-ary \(n\)-cube networks
• On the automorphism groups of us-Cayley graphs
• Fault tolerance in the arrangement graphs
• Fault-tolerant cube graphs and coding theory
• Structure fault tolerance of WK-recursive networks
• The preclusion numbers and edge preclusion numbers in a class of Cayley graphs
• Unchanging the diameter of \(k\)-ary \(n\)-cube networks with faulty vertices
• Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks
• Subnetwork reliability analysis in \(k\)-ary \(n\)-cubes
• Subnetwork preclusion for bubble-sort networks
• Structure connectivity and substructure connectivity of bubble-sort star graph networks
• Reliability analysis and fault tolerance for hypercube multi-computer networks
• The fault tolerance of \(k\)-ary \(n\)-cubes with respect to maximally local connectivity
• Fault-tolerant panconnectivity of augmented cubes
• Path and cycle fault tolerance of bubble-sort graph networks
• The fault tolerance of \(( n , k )\)-bubble-sort networks
• Embedded edge connectivity of \(k\)-ary \(n\)-cubes
• Fault tolerance of Möbius cubes under two forbidden fault set models
• Conditional fault tolerance in a class of Cayley graphs
• The reliability analysis of \(k\)-ary \(n\)-cube networks
• Subnetwork Preclusion of (n,k)-Star Networks
• A NEW FAULT-TOLERANT ROUTING ALGORITHM FOR k-ARY n-CUBE NETWORKS
• Structure connectivity and substructure connectivity of wheel networks

This page was built for publication: Fault tolerance in \(k\)-ary \(n\)-cube networks

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