Problem
Research questions and friction points this paper is trying to address.
Fast BFT SMR
replication factor
optimality
trade-offs
recovery efficiency
Optimality and Trade-offs in Fast BFT SMR (Extended Version)
🤖 AI Summary
本文研究了拜占庭容错环境下的快速状态机复制协议，提出了复制因子的上下限，并展示了一个在复制因子和恢复效率之间权衡的次优协议。
📝 Abstract
Fast state-machine replication (SMR) protocols in the crash-fault setting have attracted significant interest in both academia and industry. This interest stems from their advantages over leader-based protocols, including low execution latency for non-conflicting commands, high throughput, improved availability, and increased fairness. While Fast SMR is well studied in the crash-fault setting, the Byzantine fault-tolerant (BFT) setting remains much less understood, with only a small number of existing Fast BFT SMR protocols. In this paper, we present tight upper and lower bounds on the replication factor required for Fast BFT SMR. We also present a suboptimal protocol that illustrates a trade-off between replication factor and recovery efficiency.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Fast BFT SMR
replication factor
recovery efficiency
trade-offs
🔎 Similar Papers
💼 Related Jobs
No related jobs found.
