A dual-Hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks.

DOI10.1016/S0743-7315(02)00007-2zbMath1033.68512OpenAlexW2017812323MaRDI QIDQ1872700

Chih-Ping Chu, Tzung-Shi Chen, Nen-Chung Wang

Publication date: 14 May 2003

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0743-7315(02)00007-2

zbMATH Keywords

Wormhole routingMulticastStar graphsVirtual channelsPath-based routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Related Items (9)

Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges ⋮ Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks ⋮ Conditional edge-fault-tolerant Hamiltonicity of the data center network ⋮ Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes ⋮ Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults ⋮ Conditional edge-fault Hamiltonicity of augmented cubes ⋮ Hamiltonian paths in hypercubes with local traps ⋮ Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults ⋮ Hamiltonian cycles in hypercubes with more faulty edges

This page was built for publication: A dual-Hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks.