Optimal multicast tree routing for cluster computing in hypercube interconnection networks
Weijia Jia, Pui-on Au, Yong He, Wanlei Zhou · 2003
This paper proposes a set of novel efficient multicast routing algorithms on hypercube interconnections of cluster computers using a multicast shared-tree approach. We present some new algorithms for selecting an optimal core (root) for constructing the shared tree so as to minimize the average delay for multicast messages. Simulation results indicate that our algorithms are efficient in the sense of short end-to-end average delay, load balance and lower resource utilization over hypercube cluster connections.