Optimal Core Selection for Multicast Tree Routing in Hypercube Networks

This paper proposes a set of novel efficient fault-tolerant multicast routing algorithms on hypercube networks using shared tree routing approach. The algorithms can select 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 as compared with the existing multicast algorithms for balancing both objectives of short average delay and less resource utilizations over hypercube networks.