Token-based atomic broadcast using unreliable failure detectors
Token-based atomic broadcast using unreliable failure detectors
复制标题
DOI：
10.1109/reldis.2004.1353003
复制
发表时间：
2004-10
期刊：
影响因子：
--
通讯作者：
Richard Ekwall;A. Schiper;P. Urbán
中科院分区：
文献类型：
--
作者：
Richard Ekwall;A. Schiper;P. Urbán
在过去的二十年中，已经发表了许多原子广播算法。基于令牌的算法代表了这些算法中的一大类。有趣的是，所有基于令牌的原子广播算法都依赖于组成员服务，即，他们都没有直接使用不可靠的故障检测器。该论文提出了第一个基于令牌的原子广播算法，该算法使用不可靠的故障检测器-由/spl Rscr/表示的新故障检测器-而不是组成员服务。将失效检测器/spl Rscr/与V和S进行了比较。为了使原子广播算法更容易理解，本文从一个基于令牌的一致性算法推导出原子广播算法，该算法也使用了故障检测器/spl Rscr/。
Many atomic broadcast algorithms have been published in the last twenty years. Token-based algorithms represent a large class of these algorithms. Interestingly, all the token-based atomic broadcast algorithms rely on a group membership service, i.e., none of them uses unreliable failure detectors directly. The paper presents the first token-based atomic broadcast algorithm that uses an unreliable failure detector - the new failure detector denoted by /spl Rscr/ - instead of a group membership service. The failure detector /spl Rscr/ is compared with V and S. In order to make it easier to understand the atomic broadcast algorithm, the paper derives the atomic broadcast algorithm from a token-based consensus algorithm that also uses the failure detector /spl Rscr/.