Home > Research > Publications & Outputs > Scrooge

Research

Associated organisational units

Links

Text available via DOI:

Keywords

View graph of relations

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

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

Scrooge: Reducing the costs of fast Byzantine replication in presence of unresponsive replicas. / Serafini, M.; Bokor, P.; Dobre, D. et al.
2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN). IEEE, 2010. p. 353-362.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

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 2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN). IEEE, pp. 353-362. https://doi.org/10.1109/DSN.2010.5544295

APA

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 2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN) (pp. 353-362). IEEE. https://doi.org/10.1109/DSN.2010.5544295

Vancouver

Serafini M, Bokor P, Dobre D, Majuntke M, Suri N. Scrooge: Reducing the costs of fast Byzantine replication in presence of unresponsive replicas. In 2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN). IEEE. 2010. p. 353-362 doi: 10.1109/DSN.2010.5544295

Author

Serafini, M. ; Bokor, P. ; Dobre, D. et al. / Scrooge : Reducing the costs of fast Byzantine replication in presence of unresponsive replicas. 2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN). IEEE, 2010. pp. 353-362

Bibtex

@inproceedings{e4a74b4525634036a4ebacf4b1a56834,
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]. {\textcopyright} 2010 IEEE.",
keywords = "Arbitrary failures, Byzantine Agreement, Byzantine failures, Byzantine fault, Core principles, Fault-tolerant, Lower bounds, Optimal resilience, State machine replication, Optimization, Fault tolerant computer systems",
author = "M. Serafini and P. Bokor and D. Dobre and M. Majuntke and Neeraj Suri",
year = "2010",
month = jun,
day = "28",
doi = "10.1109/DSN.2010.5544295",
language = "English",
isbn = "9781424475001",
pages = "353--362",
booktitle = "2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN)",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - Scrooge

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

AU - Serafini, M.

AU - Bokor, P.

AU - Dobre, D.

AU - Majuntke, M.

AU - Suri, Neeraj

PY - 2010/6/28

Y1 - 2010/6/28

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]. © 2010 IEEE.

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]. © 2010 IEEE.

KW - Arbitrary failures

KW - Byzantine Agreement

KW - Byzantine failures

KW - Byzantine fault

KW - Core principles

KW - Fault-tolerant

KW - Lower bounds

KW - Optimal resilience

KW - State machine replication

KW - Optimization

KW - Fault tolerant computer systems

U2 - 10.1109/DSN.2010.5544295

DO - 10.1109/DSN.2010.5544295

M3 - Conference contribution/Paper

SN - 9781424475001

SP - 353

EP - 362

BT - 2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN)

PB - IEEE

ER -