This paper presents a fault-tolerant multicasting scheme, which is based on the concept of routing capability, for faulty hypercubes. The proposed algorithms multicast a message in an attempt to minimize derouting so that time optimality can be achieved. Moreover, they make use of the information embedded in routing capabilities to establish a message path for which an upper bound on its length may be determined at the source. Use of directed routing capability for our algorithms is also studied. Simulation results show the effectiveness of the proposed scheme.
['Ge-Ming Chiu', 'Kai-Shung Chen']
Fault-tolerant multicast in hypercube multicomputers