dorsal/arxiv
View SchemaOptimizing View Change for Byzantine Fault Tolerance in Parallel Consensus
| Authors | Yifei Xie, Btissam Er-Rahmadi, Xiao Chen, Tiejun Ma, Jane Hillston |
|---|---|
| Categories | |
| ArXiv ID | 2601.09184vv1 |
| URL | https://arxiv.org/abs/2601.09184 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
The parallel Byzantine Fault Tolerant (BFT) protocol is viewed as a promising solution to address the consensus scalability issue of the permissioned blockchain. One of the main challenges in parallel BFT is the view change process that happens when the leader node fails, which can lead to performance bottlenecks. Existing parallel BFT protocols typically rely on passive view change mechanisms with blind leader rotation. Such approaches frequently select unavailable or slow nodes as leaders, resulting in degraded performance. To address these challenges, we propose a View Change Optimization (VCO) model based on mixed integer programming that optimizes leader selection and follower reassignment across parallel committees by considering communication delays and failure scenarios. We applied a decomposition method with efficient subproblems and improved benders cuts to solve the VCO model. Leveraging the results of improved decomposition solution method, we propose an efficient iterative backup leader selection algorithm as views proceed. By performing experiments in Microsoft Azure cloud environments, we demonstrate that the VCO-driven parallel BFT outperforms existing configuration methods under both normal operation and faulty condition. The results show that the VCO model is effective as network size increases, making it a suitable solution for high-performance parallel BFT systems.
{
"annotation_id": "e94a5f55-7742-42b7-b9ed-d397bd51ccfc",
"date_created": "2026-02-17T05:53:20.073000Z",
"date_modified": "2026-02-17T05:53:20.073000Z",
"file_hash": "f7f8f5a29ed433eb91789c5ddee25e16d8af047ca11162bccee6990a89cfdba4",
"private": false,
"record": {
"abstract": "The parallel Byzantine Fault Tolerant (BFT) protocol is viewed as a promising solution to address the consensus scalability issue of the permissioned blockchain. One of the main challenges in parallel BFT is the view change process that happens when the leader node fails, which can lead to performance bottlenecks. Existing parallel BFT protocols typically rely on passive view change mechanisms with blind leader rotation. Such approaches frequently select unavailable or slow nodes as leaders, resulting in degraded performance. To address these challenges, we propose a View Change Optimization (VCO) model based on mixed integer programming that optimizes leader selection and follower reassignment across parallel committees by considering communication delays and failure scenarios. We applied a decomposition method with efficient subproblems and improved benders cuts to solve the VCO model. Leveraging the results of improved decomposition solution method, we propose an efficient iterative backup leader selection algorithm as views proceed. By performing experiments in Microsoft Azure cloud environments, we demonstrate that the VCO-driven parallel BFT outperforms existing configuration methods under both normal operation and faulty condition. The results show that the VCO model is effective as network size increases, making it a suitable solution for high-performance parallel BFT systems.",
"arxiv_id": "2601.09184",
"authors": [
"Yifei Xie",
"Btissam Er-Rahmadi",
"Xiao Chen",
"Tiejun Ma",
"Jane Hillston"
],
"categories": [
"cs.DC"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "Optimizing View Change for Byzantine Fault Tolerance in Parallel Consensus",
"url": "https://arxiv.org/abs/2601.09184",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "3926ab82-11eb-48f1-b980-5fb4f18545d1",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}