Fault tolerance properties of pyramid networks

DOI10.1109/12.743415zbMath1392.68104OpenAlexW2137892439MaRDI QIDQ4571391

D. Frank Hsu, Feng Cao, Ding-Zhu Du, Shang-Hua Teng

Publication date: 9 July 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.743415

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (13)

Proof that pyramid networks are 1-Hamiltonian-connected with high probability ⋮ A bypassing path based routing algorithm for the pyramid structures ⋮ Node-disjoint paths in a level block of generalized hierarchical completely connected networks ⋮ Edge-fault diameter of \(C_4\)-free graphs ⋮ The \(3^{*}\)-connected property of pyramid networks ⋮ On the strong distance problems of pyramid networks ⋮ \(\omega \)-wide diameters of enhanced pyramid networks ⋮ The triangular pyramid: Routing and topological properties ⋮ Two-node-Hamiltonicity of enhanced pyramid networks ⋮ Bounds on the fault-diameter of graphs ⋮ Strong Rabin numbers of folded hypercubes ⋮ The impact of the apex node on routing inside a pyramid structure ⋮ Algorithmic construction of Hamiltonians in pyramids

This page was built for publication: Fault tolerance properties of pyramid networks