随机化自适应自稳定
Randomization Adaptive Self-Stabilization
摘要：
我们提出了一个计划，将自稳定算法，使用随机化收敛过程中和收敛后的自稳定算法，仅在收敛过程中使用随机化。因此，我们减少了随机位的数量从一个无限的数量到一个有界的数量。该方案适用于每个节点存在局部谓词的情况，使得局部谓词的并集隐含全局一致性。我们证明了我们的计划在令牌循环算法的赫尔曼和最近的常数时间拜占庭自稳定时钟同步算法的Ben-Or，Dolev和Hoch。我们的计划的应用结果在第一个恒定的时间拜占庭自稳定的时钟同步算法，使用有限数量的随机位。
英文摘要：
We present a scheme to convert self-stabilizing algorithms that use randomization during and following convergence to self-stabilizing algorithms that use randomization only during convergence. We thus reduce the number of random bits from an infinite number to a bounded number. The scheme is applicable to the cases in which there exits a local predicate for each node, such that global consistency is implied by the union of the local predicates. We demonstrate our scheme over the token circulation algorithm of Herman and the recent constant time Byzantine self-stabilizing clock synchronization algorithm by Ben-Or, Dolev and Hoch. The application of our scheme results in the first constant time Byzantine self-stabilizing clock synchronization algorithm that uses a bounded number of random bits.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
