Self-Stabilizing Synchronization Algorithms

Three self-stabilizing clock synchronization algorithms will be presented. The first algorithm is self-stabilizing clock synchronization algorithm that uses bounded clock values. The algorithm guarantees convergence to a state where all clock values are identical, and are subsequently maintained to be identical. It is assumed that during the convergence period no new fault occurs. The second algorithm is wait-free self-stabilizing clock synchronization algorithm. This
algorithm is more robust than the first algorithm since it is able to cope with faults during the convergence period as well. The algorithm guarantees convergence even if processors repeatedly stop executing their program and restart. The last algorithm consider the most sever faults. The algorithm copes with a more severe (and realistic) fault model than the traditional Byzantine fault model. This algorithm stabilizes to synchronize the system clocks in the presence of Byzantine faults — A processor that experience Byzantine fault can exhibit arbitrary “malicious”, “two faced”, behavior as if it is controlled by an adversary. The talk summarizes joint works with Anish Arora, Mohamed Gouda, and Jennifer L. Welch