Probabilistic atomic broadcast

Pascal Felber & Fernando Pedone

Résumé Reliable distributed protocols, such as consensus and atomic broadcast, are known to scale poorly with large number of processes. Recent research has shown that algorithms providing probabilistic guarantees are a promising alternative for such environments. In this paper, we propose a specification of atomic broadcast with probabilistic liveness and safety guarantees. We present an algorithm that implements this specification in a truly asynchronous system (i.e., without assumptions about process speeds and message transmission times).
Citation P. Felber and F. Pedone, "Probabilistic atomic broadcast," in 21st IEEE Symposium on Reliable Distributed Systems, Osaka, Japan, 2002, p. 170-179.
Type Actes de congrès (Anglais)
Nom de la conférence 21st IEEE Symposium on Reliable Distributed Systems (Osaka, Japan)
Date de la conférence 2002
Editeur commercial Ieee Computer Soc
Pages 170-179