Abstract

We propose a new protocol for the generalized consensus problem in asynchronous systems subject to Byzantine server failures. The protocol solves the consensus problem in a setting in which information about conflict between transactions is available (such information can be in the form of transaction read and write sets). The use of non-skipping timestamps permits servers to commit transactions as soon as they know that no conflicting transaction can be ordered earlier. Unlike most prior proposals (for generalized or classical consensus), which use a leader to order transactions, this protocol is leaderless, and relies on non-skipping timestamps for transaction ordering. Being leaderless, the protocol does not need to pause for leader elections. For n servers of which f may be faulty, this protocol requires n>4f.

Original languageEnglish (US)
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings
EditorsTaisuke Izumi, Petr Kuznetsov
PublisherSpringer Verlag
Pages254-268
Number of pages15
ISBN (Print)9783030032319
DOIs
StatePublished - Jan 1 2018
Event20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018 - Tokyo, Japan
Duration: Nov 4 2018Nov 7 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11201 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018
CountryJapan
CityTokyo
Period11/4/1811/7/18

Fingerprint

State Machine
Replication
Transactions
Network protocols
Servers
Consensus Problem
Timestamp
Server
Leader Election
Asynchronous Systems
Computer systems

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Bazzi, R., & Herlihy, M. (2018). Clairvoyant state machine replications. In T. Izumi, & P. Kuznetsov (Eds.), Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings (pp. 254-268). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11201 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-03232-6_17

Clairvoyant state machine replications. / Bazzi, Rida; Herlihy, Maurice.

Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings. ed. / Taisuke Izumi; Petr Kuznetsov. Springer Verlag, 2018. p. 254-268 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11201 LNCS).

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

Bazzi, R & Herlihy, M 2018, Clairvoyant state machine replications. in T Izumi & P Kuznetsov (eds), Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11201 LNCS, Springer Verlag, pp. 254-268, 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018, Tokyo, Japan, 11/4/18. https://doi.org/10.1007/978-3-030-03232-6_17
Bazzi R, Herlihy M. Clairvoyant state machine replications. In Izumi T, Kuznetsov P, editors, Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings. Springer Verlag. 2018. p. 254-268. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-03232-6_17
Bazzi, Rida ; Herlihy, Maurice. / Clairvoyant state machine replications. Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings. editor / Taisuke Izumi ; Petr Kuznetsov. Springer Verlag, 2018. pp. 254-268 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{1fcc9a83bd084a529e060996106c7500,
title = "Clairvoyant state machine replications",
abstract = "We propose a new protocol for the generalized consensus problem in asynchronous systems subject to Byzantine server failures. The protocol solves the consensus problem in a setting in which information about conflict between transactions is available (such information can be in the form of transaction read and write sets). The use of non-skipping timestamps permits servers to commit transactions as soon as they know that no conflicting transaction can be ordered earlier. Unlike most prior proposals (for generalized or classical consensus), which use a leader to order transactions, this protocol is leaderless, and relies on non-skipping timestamps for transaction ordering. Being leaderless, the protocol does not need to pause for leader elections. For n servers of which f may be faulty, this protocol requires n>4f.",
author = "Rida Bazzi and Maurice Herlihy",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-030-03232-6_17",
language = "English (US)",
isbn = "9783030032319",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "254--268",
editor = "Taisuke Izumi and Petr Kuznetsov",
booktitle = "Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings",

}

TY - GEN

T1 - Clairvoyant state machine replications

AU - Bazzi, Rida

AU - Herlihy, Maurice

PY - 2018/1/1

Y1 - 2018/1/1

N2 - We propose a new protocol for the generalized consensus problem in asynchronous systems subject to Byzantine server failures. The protocol solves the consensus problem in a setting in which information about conflict between transactions is available (such information can be in the form of transaction read and write sets). The use of non-skipping timestamps permits servers to commit transactions as soon as they know that no conflicting transaction can be ordered earlier. Unlike most prior proposals (for generalized or classical consensus), which use a leader to order transactions, this protocol is leaderless, and relies on non-skipping timestamps for transaction ordering. Being leaderless, the protocol does not need to pause for leader elections. For n servers of which f may be faulty, this protocol requires n>4f.

AB - We propose a new protocol for the generalized consensus problem in asynchronous systems subject to Byzantine server failures. The protocol solves the consensus problem in a setting in which information about conflict between transactions is available (such information can be in the form of transaction read and write sets). The use of non-skipping timestamps permits servers to commit transactions as soon as they know that no conflicting transaction can be ordered earlier. Unlike most prior proposals (for generalized or classical consensus), which use a leader to order transactions, this protocol is leaderless, and relies on non-skipping timestamps for transaction ordering. Being leaderless, the protocol does not need to pause for leader elections. For n servers of which f may be faulty, this protocol requires n>4f.

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

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

U2 - 10.1007/978-3-030-03232-6_17

DO - 10.1007/978-3-030-03232-6_17

M3 - Conference contribution

SN - 9783030032319

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 254

EP - 268

BT - Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings

A2 - Izumi, Taisuke

A2 - Kuznetsov, Petr

PB - Springer Verlag

ER -