| Abstract |
|
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).
|
 Additional Information
|
Citation:
Pascal Felber, Fernando Pedone,
"Probabilistic Atomic Broadcast,"
srds,
p. 170,
21st IEEE Symposium on Reliable Distributed Systems (SRDS'02),
2002
|
