A tree-based fault-tolerant multicast algorithm built on top ofnpipelined circuit switching is presented. The algorithm is provablyndeadlock-free and livelock-free, requires only a single message startup,nand guarantees messages are delivered over shortest paths in thenfault-free and traffic-free case. Simulation results in two-dimensionalnmesh networks show that the algorithm produces significantly shorternaverage communication latency than previous fault-tolerant multicastnalgorithms over a range of network loads and fault conditions
展开▼
