Fault-tolerant multicasting on hypercubes

Multicast (one-to-many) communication has important applications in parallel architecture and communication networks. This paper considers the multicast problem for a d dimensional binary hypercube in the presence of F link failures, where F < d. We develop a fault-tolerant (FT) multicast heuristic, namely lookahead-multicast, by including FT features into the existing fault-free hypercube multicast heuristic. The proposed FT multicast heuristic is deadlock-free and can ensure successful multicast. Reliability measures and simulation results are reported towards the performance of this approach. It is also compared with another FT multicast heuristic.