Scrooge

Reducing the costs of fast Byzantine replication in presence of unresponsive replicas

Marco Serafini, Péter Bokor, Dan Dobre, Matthias Majuntke, Neeraj Suri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

Byzantine-Fault-Tolerant (BFT) state machine replication is an appealing technique to tolerate arbitrary failures. However, Byzantine agreement incurs a fundamental trade-off between being fast (i.e. optimal latency) and achieving optimal resilience (i.e. 2f + b+ 1 replicas, where f is the bound on failures and b the bound on Byzantine failures [9]). Achieving fast Byzantine replication despite f failures requires at least f + b - 2 additional replicas [10, 6, 8]. In this paper we show, perhaps surprisingly, that fast Byzantine agreement despite f failures is practically attainable using only b - 1 additional replicas, which is independent of the number of crashes tolerated. This makes our approach particularly appealing for systems that must tolerate many crashes (large f) and few Byzantine faults (small b). The core principle of our approach is to have replicas agree on a quorum of responsive replicas before agreeing on requests. This is key to circumventing the resilience lower bound of fast Byzantine agreement [6].

Original languageEnglish
Title of host publicationProceedings of the International Conference on Dependable Systems and Networks
Pages353-362
Number of pages10
DOIs
Publication statusPublished - 20 Sep 2010
Externally publishedYes
Event2010 IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2010 - Chicago, IL, United States
Duration: 28 Jun 20101 Jul 2010

Other

Other2010 IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2010
CountryUnited States
CityChicago, IL
Period28/6/101/7/10

Fingerprint

Costs

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Serafini, M., Bokor, P., Dobre, D., Majuntke, M., & Suri, N. (2010). Scrooge: Reducing the costs of fast Byzantine replication in presence of unresponsive replicas. In Proceedings of the International Conference on Dependable Systems and Networks (pp. 353-362). [5544295] https://doi.org/10.1109/DSN.2010.5544295

Scrooge : Reducing the costs of fast Byzantine replication in presence of unresponsive replicas. / Serafini, Marco; Bokor, Péter; Dobre, Dan; Majuntke, Matthias; Suri, Neeraj.

Proceedings of the International Conference on Dependable Systems and Networks. 2010. p. 353-362 5544295.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Serafini, M, Bokor, P, Dobre, D, Majuntke, M & Suri, N 2010, Scrooge: Reducing the costs of fast Byzantine replication in presence of unresponsive replicas. in Proceedings of the International Conference on Dependable Systems and Networks., 5544295, pp. 353-362, 2010 IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2010, Chicago, IL, United States, 28/6/10. https://doi.org/10.1109/DSN.2010.5544295
Serafini M, Bokor P, Dobre D, Majuntke M, Suri N. Scrooge: Reducing the costs of fast Byzantine replication in presence of unresponsive replicas. In Proceedings of the International Conference on Dependable Systems and Networks. 2010. p. 353-362. 5544295 https://doi.org/10.1109/DSN.2010.5544295
Serafini, Marco ; Bokor, Péter ; Dobre, Dan ; Majuntke, Matthias ; Suri, Neeraj. / Scrooge : Reducing the costs of fast Byzantine replication in presence of unresponsive replicas. Proceedings of the International Conference on Dependable Systems and Networks. 2010. pp. 353-362
@inproceedings{ad0f52f3390d4f7095d4e13fcea6633a,
title = "Scrooge: Reducing the costs of fast Byzantine replication in presence of unresponsive replicas",
abstract = "Byzantine-Fault-Tolerant (BFT) state machine replication is an appealing technique to tolerate arbitrary failures. However, Byzantine agreement incurs a fundamental trade-off between being fast (i.e. optimal latency) and achieving optimal resilience (i.e. 2f + b+ 1 replicas, where f is the bound on failures and b the bound on Byzantine failures [9]). Achieving fast Byzantine replication despite f failures requires at least f + b - 2 additional replicas [10, 6, 8]. In this paper we show, perhaps surprisingly, that fast Byzantine agreement despite f failures is practically attainable using only b - 1 additional replicas, which is independent of the number of crashes tolerated. This makes our approach particularly appealing for systems that must tolerate many crashes (large f) and few Byzantine faults (small b). The core principle of our approach is to have replicas agree on a quorum of responsive replicas before agreeing on requests. This is key to circumventing the resilience lower bound of fast Byzantine agreement [6].",
author = "Marco Serafini and P{\'e}ter Bokor and Dan Dobre and Matthias Majuntke and Neeraj Suri",
year = "2010",
month = "9",
day = "20",
doi = "10.1109/DSN.2010.5544295",
language = "English",
isbn = "9781424475018",
pages = "353--362",
booktitle = "Proceedings of the International Conference on Dependable Systems and Networks",

}

TY - GEN

T1 - Scrooge

T2 - Reducing the costs of fast Byzantine replication in presence of unresponsive replicas

AU - Serafini, Marco

AU - Bokor, Péter

AU - Dobre, Dan

AU - Majuntke, Matthias

AU - Suri, Neeraj

PY - 2010/9/20

Y1 - 2010/9/20

N2 - Byzantine-Fault-Tolerant (BFT) state machine replication is an appealing technique to tolerate arbitrary failures. However, Byzantine agreement incurs a fundamental trade-off between being fast (i.e. optimal latency) and achieving optimal resilience (i.e. 2f + b+ 1 replicas, where f is the bound on failures and b the bound on Byzantine failures [9]). Achieving fast Byzantine replication despite f failures requires at least f + b - 2 additional replicas [10, 6, 8]. In this paper we show, perhaps surprisingly, that fast Byzantine agreement despite f failures is practically attainable using only b - 1 additional replicas, which is independent of the number of crashes tolerated. This makes our approach particularly appealing for systems that must tolerate many crashes (large f) and few Byzantine faults (small b). The core principle of our approach is to have replicas agree on a quorum of responsive replicas before agreeing on requests. This is key to circumventing the resilience lower bound of fast Byzantine agreement [6].

AB - Byzantine-Fault-Tolerant (BFT) state machine replication is an appealing technique to tolerate arbitrary failures. However, Byzantine agreement incurs a fundamental trade-off between being fast (i.e. optimal latency) and achieving optimal resilience (i.e. 2f + b+ 1 replicas, where f is the bound on failures and b the bound on Byzantine failures [9]). Achieving fast Byzantine replication despite f failures requires at least f + b - 2 additional replicas [10, 6, 8]. In this paper we show, perhaps surprisingly, that fast Byzantine agreement despite f failures is practically attainable using only b - 1 additional replicas, which is independent of the number of crashes tolerated. This makes our approach particularly appealing for systems that must tolerate many crashes (large f) and few Byzantine faults (small b). The core principle of our approach is to have replicas agree on a quorum of responsive replicas before agreeing on requests. This is key to circumventing the resilience lower bound of fast Byzantine agreement [6].

UR - http://www.scopus.com/inward/record.url?scp=77956603260&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956603260&partnerID=8YFLogxK

U2 - 10.1109/DSN.2010.5544295

DO - 10.1109/DSN.2010.5544295

M3 - Conference contribution

SN - 9781424475018

SP - 353

EP - 362

BT - Proceedings of the International Conference on Dependable Systems and Networks

ER -