Reducing the costs of large-scale BFT replication

Marco Serafini, Neeraj Suri

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

Abstract

We identify three key challenges in designing large-scale fault tolerant services. The first is keeping stable best-case performance in presence of failures, which are increasingly becoming commonplace. The second is that worst-case failures should not result in major service disruptions and needs to be tolerated. The third is minimizing the costs of replicating a large number of services. While most previous work has focused on addressing the first two challenges, we propose new approaches to reduce the replication costs of BFT replication in large-scale services.

Original languageEnglish
Title of host publicationACM International Conference Proceeding Series
Volume341
DOIs
Publication statusPublished - 1 Dec 2009
Externally publishedYes
Event2nd Workshop on Large-Scale Distributed Systems and Middleware, LADIS'08 - Yorktown Heights, NY, United States
Duration: 15 Sep 200817 Sep 2008

Other

Other2nd Workshop on Large-Scale Distributed Systems and Middleware, LADIS'08
CountryUnited States
CityYorktown Heights, NY
Period15/9/0817/9/08

Fingerprint

Costs

Keywords

  • Byzantine fault tolerance
  • cost-efficient speculative execution
  • message histories
  • replier quorums

ASJC Scopus subject areas

  • Human-Computer Interaction
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Software

Cite this

Serafini, M., & Suri, N. (2009). Reducing the costs of large-scale BFT replication. In ACM International Conference Proceeding Series (Vol. 341). [1529993] https://doi.org/10.1145/1529974.1529993

Reducing the costs of large-scale BFT replication. / Serafini, Marco; Suri, Neeraj.

ACM International Conference Proceeding Series. Vol. 341 2009. 1529993.

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

Serafini, M & Suri, N 2009, Reducing the costs of large-scale BFT replication. in ACM International Conference Proceeding Series. vol. 341, 1529993, 2nd Workshop on Large-Scale Distributed Systems and Middleware, LADIS'08, Yorktown Heights, NY, United States, 15/9/08. https://doi.org/10.1145/1529974.1529993
Serafini M, Suri N. Reducing the costs of large-scale BFT replication. In ACM International Conference Proceeding Series. Vol. 341. 2009. 1529993 https://doi.org/10.1145/1529974.1529993
Serafini, Marco ; Suri, Neeraj. / Reducing the costs of large-scale BFT replication. ACM International Conference Proceeding Series. Vol. 341 2009.
@inproceedings{8b6fcf999bfd49329df615bdb741b236,
title = "Reducing the costs of large-scale BFT replication",
abstract = "We identify three key challenges in designing large-scale fault tolerant services. The first is keeping stable best-case performance in presence of failures, which are increasingly becoming commonplace. The second is that worst-case failures should not result in major service disruptions and needs to be tolerated. The third is minimizing the costs of replicating a large number of services. While most previous work has focused on addressing the first two challenges, we propose new approaches to reduce the replication costs of BFT replication in large-scale services.",
keywords = "Byzantine fault tolerance, cost-efficient speculative execution, message histories, replier quorums",
author = "Marco Serafini and Neeraj Suri",
year = "2009",
month = "12",
day = "1",
doi = "10.1145/1529974.1529993",
language = "English",
isbn = "9781605582962",
volume = "341",
booktitle = "ACM International Conference Proceeding Series",

}

TY - GEN

T1 - Reducing the costs of large-scale BFT replication

AU - Serafini, Marco

AU - Suri, Neeraj

PY - 2009/12/1

Y1 - 2009/12/1

N2 - We identify three key challenges in designing large-scale fault tolerant services. The first is keeping stable best-case performance in presence of failures, which are increasingly becoming commonplace. The second is that worst-case failures should not result in major service disruptions and needs to be tolerated. The third is minimizing the costs of replicating a large number of services. While most previous work has focused on addressing the first two challenges, we propose new approaches to reduce the replication costs of BFT replication in large-scale services.

AB - We identify three key challenges in designing large-scale fault tolerant services. The first is keeping stable best-case performance in presence of failures, which are increasingly becoming commonplace. The second is that worst-case failures should not result in major service disruptions and needs to be tolerated. The third is minimizing the costs of replicating a large number of services. While most previous work has focused on addressing the first two challenges, we propose new approaches to reduce the replication costs of BFT replication in large-scale services.

KW - Byzantine fault tolerance

KW - cost-efficient speculative execution

KW - message histories

KW - replier quorums

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

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

U2 - 10.1145/1529974.1529993

DO - 10.1145/1529974.1529993

M3 - Conference contribution

AN - SCOPUS:77953842968

SN - 9781605582962

VL - 341

BT - ACM International Conference Proceeding Series

ER -