Computer Science

Recent results on fault-tolerant consensus in message-passing networks

Document Type

Conference Paper

Abstract

Fault-tolerant consensus has been studied extensively in the literature, because it is one of the important distributed primitives and has wide applications in practice. This paper surveys important works on fault-tolerant consensus in message-passing networks, and the focus is on results from the past decade. Particularly, we categorize the results into two groups: new problem formulations and practical applications. In the first part, we discuss new ways to define the consensus problem, which include larger input domains, enriched correctness properties, different network models, etc. In the second part, we focus on real-world systems that use Paxos or Raft to reach consensus, and Byzantine Fault-Tolerant (BFT) systems. We also discuss Bitcoin, which can be related to solving Byzantine consensus in anonymous systems, and compare Bitcoin with BFT systems and Byzantine consensus algorithms.

Publication Title

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

Publication Date

2016

Volume

9988 LNCS

First Page

92

Last Page

108

ISSN

0302-9743

ISBN

9783319483139

DOI

10.1007/978-3-319-48314-6_7

Keywords

BFT, Bitcoin, Byzantine, consensus, crash, paxos

APA Citation

Tseng, L. (2016). Recent results on fault-tolerant consensus in message-passing networks. In Structural Information and Communication Complexity: 23rd International Colloquium, SIROCCO 2016, Helsinki, Finland, July 19-21, 2016, Revised Selected Papers 23 (pp. 92-108). Springer International Publishing.

Link to Full Text

Share

COinS