.png){kind=icon}
返回
ParBFT: An Optimized Byzantine Consensus Parallelism Scheme
.png){kind=icon}
OA
AI
DOI：10.1109/TC.2023.3296916.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Byzantine fault-tolerance (BFT) consensus is a fundamental building block of distributed systems such as blockchains. However, implementations based on classic PBFT and most linear PBFT-variants still suffer from message communication complexity, restricting the scalability and performance of BFT algorithms when serving large-scale systems with growing numbers of peers. To tackle the scalability and performance challenges, we propose ParBFT, a new Byzantine consensus parallelism scheme combining classic BFT protocols and a novel Bilevel Mixed-Integer Linear Programming (BL-MILP)-based optimisation model. The core aim of ParBFT is to improve scalability via parallel consensus while providing enhanced safety (i.e. ensuring consistent total order across all correct replicas). Another core novelty is the integration of the BL-MILP model into ParBFT. The BL-MILP allows us to compute optimal numerical decisions for parallel committees (i.e. the optimal number of committees and peer allocation for each committee) and improve consensus performance while ensuring security. Finally, we test the performance of the proposed ParBFT on Microsoft Azure Cloud systems with 20 to 300 peers and find that ParBFT can achieve significant improvement compared to the state-of-the-art protocols.
Keyword:
Scalability
Safety
Optimization
Peer-to-peer computing
Parallel processing
Fault tolerant systems
Fault tolerance
Byzantine fault tolerance
parallel consensus
blockchains
consensus committee optimisation
期刊
IF:
3.8
论文数:
5.3K
被引数:
9.8K
机构
引用论文
.png){kind=icon}
Comparing the sensitivities and specificities of two diagnostic procedures performed on the same group of patients.比较对同一组患者进行的两种诊断程序的敏感性和特异性。
PREAI
分享收藏分享收藏
查看更多内容