Multicast communication in wormhole-routed star graph interconnection networks

Multicast, an important communication mechanism, is frequently applied in parallel computing. The star graph interconnection network, when compared with the hypercube network, being with low degree and small diameter, has been recognized to be an attractive alternative to the popular hypercube network. In this paper, we derive a node labeling formula based on a hamiltonian path and propose four e cient multicast routing schemes in wormhole-routed star networks with multidestination routing capability. All of the four proposed schemes are path-based and deadlock-free. The rst scheme, dual-path routing, sends the message in parallel through two independent paths (toward high label nodes and low label nodes). The second one, shortcut-node-based dual-path routing, is similar to dual-path routing except that the routing tries to nd a shortcut node to route the message as soon as possible to reduce the length of transmission path. The third one, multipath routing, is a multiple dual-path ro...

• Type: Journal
• Year: 2000
• Where: PC
• Authors: Tzung-Shi Chen, Neng-Chung Wang, Chih-Ping Chu
• Keywords: Dual-path Routing, Management, PC 2000, Routing, Routing Schemes