In this paper, we revisit the performance of the α-synchronizer in distributed systems with probabilistic message loss as introduced in Függer et al. [Perf. Eval. 93(2015)]. In sharp contrast to the infinite-state Markov chain resp. the exponential-size finite-state upper bound presented in the original paper, we introduce a polynomial-size finite-state Markov chain for a new synchronizer variant \(\alpha ^{\prime }\), which provides a new upper bound on the performance of the α-synchronizer. Both analytic and simulation results show that our new upper bound is strictly better than the existing one. Moreover, we show that a modified version of the \(\alpha ^{\prime }\)-synchronizer provides a lower bound on the performance of the α-synchronizer. By means of elaborate simulation results, we show that our new lower bound is also strictly better than the lower bound presented in the original paper.

在本文中，我们将重新讨论α同步器在分布式系统中的性能，该系统具有概率性消息丢失的情况，如Függer等人所述。[性能 评估 93（2015）]。与无限状态马尔可夫链分别形成鲜明对比。在原始论文中提出的指数大小的有限状态上限，我们为新的同步器变体\（\ alpha ^ {\ prime} \）引入了多项式大小的有限状态马尔可夫链，它提供了一个新的上限。α同步器的性能。解析和仿真结果均表明，我们的新上限严格优于现有上限。此外，我们显示\（\ alpha ^ {\ prime} \）- synchronizer的修改版本为α-同步器。通过详尽的仿真结果，我们表明我们的新下限也严格优于原始论文中提出的下限。