Loading [a11y]/accessibility-menu.js
Bounded Delay in Byzantine-Tolerant State Machine Replication | IEEE Conference Publication | IEEE Xplore

Bounded Delay in Byzantine-Tolerant State Machine Replication


Abstract:

The paper proposes a new state machine replication protocol for the partially synchronous system model with Byzantine faults. The algorithm, called BFT-Mencius, guarantee...Show More

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.
Date of Conference: 30 September 2013 - 03 October 2013
Date Added to IEEE Xplore: 07 November 2013
Electronic ISBN:978-0-7695-5115-9

ISSN Information:

Conference Location: Braga, Portugal

References

References is not available for this document.