A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices

DOI10.1142/S0129054117500319zbMath1387.68040OpenAlexW2789183264MaRDI QIDQ4639925

Lili Guo, Cheng-Kuan Lin, Xi Wang, Jingya Zhou, Jianxi Fan

Publication date: 14 May 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054117500319

zbMATH Keywords

connectivityinterconnection networksfault-free pathgeneralized hypercubesset of restricted faulty vertices

Mathematics Subject Classification ID

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

Related Items

Reliability evaluation for a class of recursive match networks, The \(h\)-restricted connectivity of the generalized hypercubes, Communication Performance Evaluation of the Locally Twisted Cube

Cites Work

• The restricted \(h\)-connectivity of the data center network DCell
• One-to-one communication in twisted cubes under restricted connectivity
• Efficient unicast in bijective connection networks with the restricted faulty node set
• An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
• Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
• \(\{2,3\}\)-restricted connectivity of locally twisted cubes
• The existence and upper bound for two types of restricted connectivity
• Combinatorial properties of generalized hypercube graphs
• On restricted connectivity and extra connectivity of hypercubes and folded hypercubes
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Conditional connectivity