Abstract
The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In this paper we first address a dual-Hamiltonian-path-based (DHPB) routing model with two virtual channels based on two Hamiltonian paths and a network partitioning strategy for wormhole-routed star graph networks. Then, we propose three efficient multicast routing schemes on basis of such a model. The proposed schemes are network-selection-based (NSB), heuristic-network-selection-based (HNSB), and two-phase heuristic-network-selection-based (TP-HNSB) dual-path routing. All of the three proposed schemes are deadlock-free. Finally, experimental results are given to show our proposed three routing schemes outperform the unicast-based, the Hamiltonian-path, and the single-Hamiltonian-path-based (SHPB) dual-path routing schemes significantly.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
