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 条
  • [21] CloudBFT: Elastic Byzantine Fault Tolerance
    Nogueira, Rodrigo
    Araujo, Filipe
    Barbosa, Raul
    2014 20TH IEEE PACIFIC RIM INTERNATIONAL SYMPOSIUM ON DEPENDABLE COMPUTING (PRDC 2014), 2014, : 180 - 189
  • [22] RBFT: Redundant Byzantine Fault Tolerance
    Aublin, Pierre-Louis
    Ben Mokhtar, Sonia
    Quema, Vivien
    2013 IEEE 33RD INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS), 2013, : 297 - 306
  • [23] Byzantine fault tolerance for agent systems
    Araragi, Tadashi
    DEPCOS-RELCOMEX 2006, 2006, : 232 - 239
  • [24] Byzantine fault tolerance for nondeterministic applications
    Zhao, Weribing
    DASC 2007: THIRD IEEE INTERNATIONAL SYMPOSIUM ON DEPENDABLE, AUTONOMIC AND SECURE COMPUTING, PROCEEDINGS, 2007, : 108 - 115
  • [25] Dynamic Practical Byzantine Fault Tolerance
    Xu Hao
    Long Yu
    Liu Zhiqiang
    Liu Zhen
    Gu Dawu
    2018 IEEE CONFERENCE ON COMMUNICATIONS AND NETWORK SECURITY (CNS), 2018,
  • [26] Byzantine fault tolerance can be fast
    Castro, M
    Liskov, B
    INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, 2001, : 513 - 518
  • [27] High throughput Byzantine Fault Tolerance
    Kotla, R
    Dahlin, M
    2004 INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, 2004, : 575 - 584
  • [28] Zyzzyva: Speculative Byzantine Fault Tolerance
    Kotla, Ramakrishna
    Alvisi, Lorenzo
    Dahlin, Mike
    Clement, Allen
    Wong, Edmund
    ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2009, 27 (04):
  • [29] Quorum Selection for Byzantine Fault Tolerance
    Jehl, Leander
    2019 39TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2019), 2019, : 2168 - 2177
  • [30] Zyzzyva: Speculative Byzantine Fault Tolerance
    Kotla, Ramakrishna
    Clement, Allen
    Wong, Edmund
    Alvisi, Lorenzo
    Dahlin, Mike
    COMMUNICATIONS OF THE ACM, 2008, 51 (11) : 86 - 95