Tree-based fault-tolerant multicast in multicomputer networks

A tree-based fault-tolerant multicast algorithm built on top of pipelined circuit switching is presented. The algorithm is provably deadlock-free and livelock-free, requires only a single message startup, and guarantees messages are delivered over shortest paths in the fault-free and traffic-free case. Simulation results in two-dimensional mesh networks show that the algorithm produces significantly shorter average communication latency than previous fault-tolerant multicast algorithms over a range of network loads and fault conditions.