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 条
  • [1] A RESOURCE-EFFICIENT PROBABILISTIC FAULT SIMULATOR
    May, David
    Stechele, Walter
    2013 23RD INTERNATIONAL CONFERENCE ON FIELD PROGRAMMABLE LOGIC AND APPLICATIONS (FPL 2013) PROCEEDINGS, 2013,
  • [2] Efficient Byzantine Fault-Tolerance
    Veronese, Giuliana Santos
    Correia, Miguel
    Bessani, Alysson Neves
    Lung, Lau Cheuk
    Verissimo, Paulo
    IEEE TRANSACTIONS ON COMPUTERS, 2013, 62 (01) : 16 - 30
  • [3] Continual flow pipelines: Achieving resource-efficient latency tolerance
    Srinivasan, ST
    Rajwar, R
    Akkary, H
    Gandhi, A
    Upton, M
    IEEE MICRO, 2004, 24 (06) : 62 - 73
  • [4] Resource-efficient and sustainable
    Konstruktion, 2016, 68 (03):
  • [5] Blockchain efficient Byzantine fault tolerance consensus algorithm for IIoT
    Li, Fengqi
    Song, Qingqing
    Xu, Hui
    Du, Xuefeng
    Gao, Jialong
    Tong, Ning
    Wang, Deguang
    Tongxin Xuebao/Journal on Communications, 2024, 45 (05): : 165 - 177
  • [6] Trebiz: Byzantine Fault Tolerance with Byzantine Merchants
    Dai, Xiaohai
    Huang, Liping
    Xiao, Jiang
    Zhang, Zhaonan
    Xie, Xia
    Jin, Hai
    PROCEEDINGS OF THE 38TH ANNUAL COMPUTER SECURITY APPLICATIONS CONFERENCE, ACSAC 2022, 2022, : 923 - 935
  • [7] Egalitarian Byzantine Fault Tolerance
    Eischer, Michael
    Distler, Tobias
    2021 IEEE 26TH PACIFIC RIM INTERNATIONAL SYMPOSIUM ON DEPENDABLE COMPUTING (PRDC 2021), 2021, : 77 - 86
  • [8] Parallel Byzantine Fault Tolerance
    Zbierski, Maciej
    SOFT COMPUTING IN COMPUTER AND INFORMATION SCIENCE, 2015, 342 : 321 - 333
  • [9] Optimistic Byzantine fault tolerance
    Zhao, Wenbing
    INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2016, 31 (03) : 254 - 267
  • [10] Byzantine Fault Tolerance as a Service
    Chai, Hua
    Zhao, Wenbing
    COMPUTER APPLICATIONS FOR WEB, HUMAN COMPUTER INTERACTION, SIGNAL AND IMAGE PROCESSING AND PATTERN RECOGNITION, 2012, 342 : 173 - 179