Next Article in Journal
Estimating the Volume of the Solution Space of SMT(LIA) Constraints by a Flat Histogram Method
Next Article in Special Issue
Cover Time in Edge-Uniform Stochastically-Evolving Graphs
Previous Article in Journal
Complexity of Hamiltonian Cycle Reconfiguration
Previous Article in Special Issue
Relaxed Data Types as Consistency Conditions
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(9), 141; https://doi.org/10.3390/a11090141

Generalized Paxos Made Byzantine (and Less Complex)

1
INESC-ID and Instituto Superior Técnico (Universidade de Lisboa), R. Alves Redol 9, 1000-029 Lisbon, Portugal
2
Department of Computer Science and Information Sciences Insititute, University of Southern California, Los Angeles, CA 90007, USA
This paper is an extended version of our paper published in SSS 2017: Stabilization, Safety, and Security of Distributed Systems, Boston, MA, USA, 5–8 November 2017.
*
Author to whom correspondence should be addressed.
Received: 26 February 2018 / Revised: 1 August 2018 / Accepted: 9 August 2018 / Published: 17 September 2018
Full-Text   |   PDF [373 KB, uploaded 18 September 2018]   |  

Abstract

One of the most recent members of the Paxos family of protocols is Generalized Paxos. This variant of Paxos has the characteristic that it departs from the original specification of consensus, allowing for a weaker safety condition where different processes can have a different views on a sequence being agreed upon. However, much like the original Paxos counterpart, Generalized Paxos does not have a simple implementation. Furthermore, with the recent practical adoption of Byzantine fault tolerant protocols in the context of blockchain protocols, it is timely and important to understand how Generalized Paxos can be implemented in the Byzantine model. In this paper, we make two main contributions. First, we attempt to provide a simpler description of Generalized Paxos, based on a simpler specification and the pseudocode for a solution that can be readily implemented. Second, we extend the protocol to the Byzantine fault model, and provide the respective correctness proof. View Full-Text
Keywords: Byzantine fault tolerance; consensus; Paxos Byzantine fault tolerance; consensus; Paxos
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Pires, M.; Ravi, S.; Rodrigues, R. Generalized Paxos Made Byzantine (and Less Complex). Algorithms 2018, 11, 141.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top