Name
Abstract | ||
|---|---|---|
The paper proposes a new state machine replication protocol for the partially synchronous system model with Byzantine faults. The algorithm, called BFT-Mencius, guarantees that the latency of updates initiated by correct processes is eventually upper-bounded, even in the presence of Byzantine processes. BFTMencius is based on a new communication primitive, Abortable Timely Announced Broadcast (ATAB), and does not use signatures. We evaluate the performance of BFT-Mencius in cluster settings, and show that it provides bounded latency and good throughput, being comparable to the state-of-the-art algorithms such as PBFT and Spinning in fault-free configurations and outperforming them under performance attacks by Byzantine processes. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/SRDS.2013.15 | Reliable Distributed Systems |
Keywords | DocType | Citations |
byzantine-tolerant state machine replication,bounded delay,fundamental building,dynamic network,classical setting,global knowledge,full set,centric service,shared memory,high available data,fault-tolerant consensus,shared memory model,finite state machines,protocols | Conference | 7 |
PageRank | References | Authors |
0.43 | 21 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zarko Milosevic | 1 | 56 | 10.35 |
| Martin Biely | 2 | 98 | 9.12 |
| André Schiper | 3 | 3537 | 275.09 |