Resource-Efficient Byzantine Fault Tolerance

被引:68
作者
Distler, Tobias [1 ]
Cachin, Christian [2 ]
Kapitza, Ruediger [3 ]
机构
[1] Univ Erlangen Nurnberg, Dept Comp Sci Distributed Syst & Operating Syst 4, Erlangen, Germany
[2] IBM Res Zurich, Ruschlikon, Switzerland
[3] TU Braunschweig, Inst Operating Syst & Comp Networks, Braunschweig, Germany
关键词
Byzantine fault tolerance; state machine replication; distributed systems;
D O I
10.1109/TC.2015.2495213
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
One of the main reasons why Byzantine fault-tolerant (BFT) systems are currently not widely used lies in their high resource consumption: 3f + 1 replicas are required to tolerate only f faults. Recent works have been able to reduce the minimum number of replicas to 2f + 1 by relying on trusted subsystems that prevent a faulty replica from making conflicting statements to other replicas without being detected. Nevertheless, having been designed with the focus on fault handling, during normal-case operation these systems still use more resources than actually necessary to make progress in the absence of faults. This paper presents Resource-efficient Byzantine Fault Tolerance (REBFT), an approach that minimizes the resource usage of a BFT system during normal-case operation by keeping f replicas in a passive mode. In contrast to active replicas, passive replicas neither participate in the agreement protocol nor execute client requests; instead, they are brought up to speed by verified state updates provided by active replicas. In case of suspected or detected faults, passive replicas are activated in a consistent manner. To underline the flexibility of our approach, we apply REBFT to two existing BFT systems: PBFT and MinBFT.
引用
收藏
页码:2807 / 2819
页数:13
相关论文
共 50 条
  • [41] Design and implementation of a Byzantine fault tolerance framework for Web services
    Zhao, Wenbing
    [J]. JOURNAL OF SYSTEMS AND SOFTWARE, 2009, 82 (06) : 1004 - 1015
  • [42] Practical Byzantine fault tolerance consensus based on comprehensive reputation
    Jiamou Qi
    Yepeng Guan
    [J]. Peer-to-Peer Networking and Applications, 2023, 16 : 420 - 430
  • [43] Research on Consensus Efficiency Based on Practical Byzantine Fault Tolerance
    Zhang, Li
    Li, Qinwei
    [J]. PROCEEDINGS OF 2018 10TH INTERNATIONAL CONFERENCE ON MODELLING, IDENTIFICATION AND CONTROL (ICMIC), 2018,
  • [44] DBFT: A Byzantine Fault Tolerance Protocol With Graceful Performance Degradation
    Zhang, Jingjing
    Rong, Yingyao
    Cao, Jiannong
    Rong, Chunming
    Bian, Jing
    Wu, Weigang
    [J]. IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2022, 19 (05) : 3387 - 3400
  • [45] Efficient Middleware for Byzantine Fault Tolerant Database Replication
    Garcia, Rui
    Rodrigues, Rodrigo
    Preguica, Nuno
    [J]. EUROSYS 11: PROCEEDINGS OF THE EUROSYS 2011 CONFERENCE, 2011, : 107 - 121
  • [47] TINYBFT: Byzantine Fault-Tolerant Replication for Highly Resource-Constrained Embedded Systems
    Boehm, Harald
    Distler, Tobias
    Waegemann, Peter
    [J]. 2024 IEEE 30TH REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM, RTAS 2024, 2023, : 225 - 238
  • [48] SPLITBFT: Improving Byzantine Fault Tolerance Safety Using Trusted Compartments
    Messadi, Ines
    Becker, Markus Horst
    Bleeke, Kai
    Jehl, Leander
    Ben Mokhtar, Sonia
    Kapitza, Ruediger
    [J]. PROCEEDINGS OF THE TWENTY-THIRD ACM/IFIP INTERNATIONAL MIDDLEWARE CONFERENCE, MIDDLEWARE 2022, 2022, : 56 - 68
  • [49] Reputation-based Byzantine Fault-Tolerance for Consortium Blockchain
    Lei, Kai
    Zhang, Qichao
    Xu, Limei
    Qi, Zhuyun
    [J]. 2018 IEEE 24TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS 2018), 2018, : 604 - 611
  • [50] Hierarchical Byzantine fault-tolerance protocol for permissioned blockchain systems
    Quang Tung Thai
    Jong-Chul Yim
    Tae-Whan Yoo
    Hyun-Kyung Yoo
    Ji-Young Kwak
    Sun-Me Kim
    [J]. The Journal of Supercomputing, 2019, 75 : 7337 - 7365