RBFT: a new Byzantine fault-tolerant consensus mechanism based on Raft cluster

被引：0
|
作者：
Huang D. [1 ]
Li L. [1 ]
Chen B. [1 ]
Wang B. [1 ]
机构：
[1] Guangxi Key Laboratory of Wireless Wideband Communication and Signal Processing, Guilin University of Electronic Technology, Guilin
来源：
Tongxin Xuebao/Journal on Communications | 2021年 / 42卷 / 03期
关键词：
Consensus mechanism; Consortium blockchain; Network fragmentation; PBFT; Raft;
D O I：
10.11959/j.issn.1000-436x.2021043
中图分类号：
学科分类号：
摘要：
The existing consensus mechanisms of consortium blockchain are not scalable enough to provide low latency, high throughput and security while supporting large-scale network. A new consensus mechanism called RBFT was proposed to improve scalability, which was a two-level consensus mechanism with supervised nodes based on the idea of network fragmentation. In RBFT, the nodes were firstly divided into several groups. Each group adopted the improved Raft me-chanism to reach consensus and select leader. Then, the leaders of each group formed the network committee, and the network committee adopted PBFT mechanism for consensus. Comparative experiments verify that RBFT can tolerant Byzantine fault while ensuring high consensus efficiency in large-scale network compared with PBFT and Raft. © 2021, Editorial Board of Journal on Communications. All right reserved.
引用
下载
收藏
页码：209 / 219
页数：10
相关论文
共 30 条
  • [1] NAKAMOTO S., Bitcoin: a peer-to-peer electronic cash system
  • [2] ZHANG X J, CAO C, HU R F, Et al., Huawei blockchain white paper
  • [3] BREWER E A., Towards robust distributed systems, Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, (2000)
  • [4] WANG W B, DINH T H, XIONG Z H, Et al., A survey on consensus mechanisms and mining management in blockchain networks, (2018)
  • [5] BUTERIN V., A next-generation smart con-tract and decentralized application platform, Etherum, 1, pp. 1-36, (2014)
  • [6] LARIMER D., Delegated proof of stake consensus
  • [7] CASTRO M, LISKOV B., Practical Byzantine fault tolerance, Proceedings of the Third Symposium on Operating Systems Design and Implementation, pp. 173-186, (1999)
  • [8] LAMPORT L., The part-time parliament, ACM Transactions on Computer Systems, 16, 2, pp. 133-169, (1998)
  • [9] ONGARO D, OUSTERHOUT J., In search of an understandable consensus algorithm, Proceedings of USENIX ATC'14: 2014 USENIX Annual Technical Conference, pp. 305-320, (2014)
  • [10] KWON J., Tendermint: consensus without mining
123