One-to-one communication in twisted cubes under restricted connectivity

DOI10.1007/S11704-010-0327-5zbMATH Open1267.68033OpenAlexW1965979479MaRDI QIDQ352013FDOQ352013

Authors: Jianxi Fan, KenLi Li, Shukui Zhang, Wujun Zhou, Baolei Cheng 

Publication date: 4 July 2013

Published in: Frontiers of Computer Science in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11704-010-0327-5

Recommendations

• Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks
• The twisted-cube connected networks
• Communication Performance Evaluation of the Locally Twisted Cube
• Transmitting in the \(n\)-dimensional cube
• Optimal broadcasting for locally twisted cubes
• Efficient collective communications in dual-cube
• Tight Network Topology Dependent Bounds on Rounds of Communication
• Optimum broadcasting and personalized communication in hypercubes

zbMATH Keywords

connectivityfault-free pathset of restricted faulty nodestwisted cubeunicast

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Network design and communication in computer systems (68M10)

Cites Work

• Conditional connectivity
• The Mobius cubes
• The locally twisted cubes
• Embedding of cycles in twisted cubes with edge-pancyclic
• Optimal fault-tolerant embedding of paths in twisted cubes
• Topological properties of twisted cube
• Fault-tolerant Hamiltonicity of twisted cubes

Cited In (6)

• The restricted \(h\)-connectivity of the data center network DCell
• Efficient unicast in bijective connection networks with the restricted faulty node set
• A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
• Hamiltonian properties of honeycomb meshes
• Communication Performance Evaluation of the Locally Twisted Cube
• Transmitting in the \(n\)-dimensional cube

This page was built for publication: One-to-one communication in twisted cubes under restricted connectivity

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