Home > Research > Publications & Outputs > Reducing the costs of large-scale BFT replication

Links

Text available via DOI:

View graph of relations

Reducing the costs of large-scale BFT replication

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published

Standard

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

LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware. ACM, 2008. 14.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Harvard

Serafini, M & Suri, N 2008, Reducing the costs of large-scale BFT replication. in LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware., 14, ACM. https://doi.org/10.1145/1529974.1529993

APA

Serafini, M., & Suri, N. (2008). Reducing the costs of large-scale BFT replication. In LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware [14] ACM. https://doi.org/10.1145/1529974.1529993

Vancouver

Serafini M, Suri N. Reducing the costs of large-scale BFT replication. In LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware. ACM. 2008. 14 doi: 10.1145/1529974.1529993

Author

Serafini, M. ; Suri, Neeraj. / Reducing the costs of large-scale BFT replication. LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware. ACM, 2008.

Bibtex

@inproceedings{3fccfa08be5148a18403e2ba22853f60,
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. {\textcopyright} ACM 2008.",
keywords = "Byzantine fault tolerance, cost-efficient speculative execution, message histories, replier quorums, Cost-efficient, Fault-tolerant, New approaches, Number of services, Replication cost, Service disruptions, Speculative execution, Cost reduction, Fault tolerant computer systems, Middleware, Quality assurance, Fault tolerance",
author = "M. Serafini and Neeraj Suri",
year = "2008",
month = sep,
day = "15",
doi = "10.1145/1529974.1529993",
language = "English",
isbn = "9781605582962",
booktitle = "LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware",
publisher = "ACM",

}

RIS

TY - GEN

T1 - Reducing the costs of large-scale BFT replication

AU - Serafini, M.

AU - Suri, Neeraj

PY - 2008/9/15

Y1 - 2008/9/15

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. © ACM 2008.

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. © ACM 2008.

KW - Byzantine fault tolerance

KW - cost-efficient speculative execution

KW - message histories

KW - replier quorums

KW - Cost-efficient

KW - Fault-tolerant

KW - New approaches

KW - Number of services

KW - Replication cost

KW - Service disruptions

KW - Speculative execution

KW - Cost reduction

KW - Fault tolerant computer systems

KW - Middleware

KW - Quality assurance

KW - Fault tolerance

U2 - 10.1145/1529974.1529993

DO - 10.1145/1529974.1529993

M3 - Conference contribution/Paper

SN - 9781605582962

BT - LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware

PB - ACM

ER -