Broadcasting in hypercubes with link/node failures

The authors propose simple and optimal fault-tolerant broadcasting algorithms in the presence of at most n-1 link or node faults in an n-dimensional hypercube. Further results for up to 2n -3 faulty links or nodes are also considered. These algorithms are optimal or close to optimal in terms of the number of communication steps. The algorithm takes n+1 time steps even in the presence of n-1 faulty links or nodes; this can be achieved even with a single port for up to 2n-3 link or node faults, even with a single port, the algorithms take at most n+3 steps