Optimal schemes for disseminating information and their fault tolerance

The authors describe two information disseminating schemes, t-disseminate and t-R disseminate in a computer network with N processors, where each processor can send a message to t-directions at each round. If no processors have failed, these schemes are time optimal. When at most t processors have failed, for t=1 and t=2 any of these schemes can broadcast information within any consecutive ⌈logtÅ+1N⌉+2 rounds, and for an arbitrary t they can broadcast information within any consecutive ⌈logtÅ+1N⌉+3 rounds.