Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
Total order broadcast on pervasive systems
Proceedings of the 2008 ACM symposium on Applied computing
Throughput optimal total order broadcast for cluster environments
ACM Transactions on Computer Systems (TOCS)
Modeling and validating the performance of atomic broadcast algorithms in high latency networks
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
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.