Fault-Tolerant Broadcast Algorithm for Tree Networks

In this paper, we propose the first fault containing broadcast algorithm for transient faults in tree networks. A transient fault refers to a fault that perturbs the state of system processes but not their programs. After some transient faults takes place, we assume that sufficient amount of time elapses without faults until the system system recovers. Our proposed algorithm contains and self-heals unlimited number of transient fault in at most O(3) rounds provided that any two faulty processes are separated by two non-faulty processes.