Token-based Atomic Broadcast using Unreliable Failure Detectors

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 R - instead of a group membership service. The failure detector R is compared with <>P 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 R.

Published in:
Proceedings of the 23rd Symposium on Reliable Distributed Systems (SRDS 2004)

Note: The status of this file is: Anyone

 Record created 2005-05-20, last modified 2020-10-28

Download fulltext

Rate this document:

Rate this document:
(Not yet reviewed)