000171010 001__ 171010
000171010 005__ 20190316235238.0
000171010 0247_ $$2doi$$a10.1109/TDSC.2010.24
000171010 02470 $$2ISI$$a000294417500001
000171010 037__ $$aARTICLE
000171010 245__ $$aA Fault-Tolerant Token-Based Atomic Broadcast Algorithm
000171010 269__ $$a2011
000171010 260__ $$c2011
000171010 336__ $$aJournal Articles
000171010 520__ $$aMany atomic broadcast algorithms have been published in the last 20 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 and none of them uses unreliable failure detectors directly. This paper presents the first token-based atomic broadcast algorithm that uses an unreliable failure detector instead of a group membership service. It requires a system size that is quadratic in the number of supported failures. The special case of a single supported failure (f = 1) requires n = 3 processes. We experimentally evaluate the performance of this algorithm in local and wide area networks, in order to emphasize that atomic broadcast is efficiently implemented by combining a failure detector and a token-based mechanism. The evaluation shows that the new token-based algorithm surpasses the performance of the other algorithms in most small-system settings.
000171010 6531_ $$aDistributed systems
000171010 6531_ $$afault tolerance
000171010 6531_ $$aperformance measurements
000171010 6531_ $$aDistributed Systems
000171010 6531_ $$aFailure Detectors
000171010 6531_ $$aGroup Membership
000171010 6531_ $$aMulticast
000171010 700__ $$aEkwall, Richard
000171010 700__ $$g106377$$aSchiper, Andre$$0241767
000171010 773__ $$j8$$tIeee Transactions On Dependable And Secure Computing$$q625-639
000171010 8564_ $$uhttps://infoscience.epfl.ch/record/171010/files/token.pdf$$zn/a$$s515614$$yn/a
000171010 909C0 $$xU10411$$0252206$$pLSR
000171010 909CO $$qGLOBAL_SET$$pIC$$ooai:infoscience.tind.io:171010$$particle
000171010 917Z8 $$x106377
000171010 937__ $$aEPFL-ARTICLE-171010
000171010 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000171010 980__ $$aARTICLE