Robust Stabilizing Leader Election
Robust Stabilizing Leader Election
复制标题
稳健的稳定领导人选举
DOI：
10.1007/978-3-540-76627-8_18
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
H. Fauconnier
中科院分区：
文献类型：
--
作者：
C. Delporte;Stéphane Devismes;H. Fauconnier
我们混合了两种容错方法：鲁棒性和稳定性。利用这些方法，我们提出了容忍瞬态和崩溃故障的领导者选举算法。我们的目标是展示在各种具有弱可靠性和同步假设的系统中鲁棒自稳定和/或伪稳定领导选举的可实现性。在可能的情况下，我们试图提出有效的通信实现方案。此外，我们还展示了获得稳健稳定领导者选举算法所需的一些假设。我们的研究结果表明，当我们考虑不动点问题（如领导人选举）时，鲁棒性与稳定鲁棒性之间的差距并不明显。
We mix two approaches of the fault-tolerance: robustness and stabilization. Using these approaches, we propose leader election algorithms that tolerate both transient and crash failures. Our goal is to show the implementability of the robust self- and/or pseudo- stabilizing leader election in various systems with weak reliability and synchrony assumptions. We try to propose, when it is possible, communicationefficient implementations. Also, we exhibit some assumptions required to obtain robust stabilizing leader election algorithms. Our results show that the gap between robustness and stabilizing robustness is not really significant when we consider fix-point problems such as leader election.