Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Fast Byzantine Consensus Jean-Philippe Martin, Lorenzo Alvisi
 

Summary: Fast Byzantine Consensus
Jean-Philippe Martin, Lorenzo Alvisi
Department of Computer Sciences
The University of Texas at Austin
Email: {jpmartin, lorenzo}@cs.utexas.edu
Abstract
We present the first consensus protocol that reaches
asynchronous Byzantine consensus in two communication
steps in the common case. We prove that our protocol is op-
timal in terms of both number of communication step, and
number of processes for 2-step consensus. The protocol can
be used to build a replicated state machine that requires
only three communication steps per request in the common
case.
1 Introduction
The consensus problem can be described in terms of the
actions taken by three classes of agents: proposers, who
propose values, acceptors, who together are responsible for
choosing a single proposed value, and learners, who must
learn the chosen value [12]. A single process can act as

  

Source: Alvisi, Lorenzo - Department of Computer Sciences, University of Texas at Austin
Dahlin, Michael D. - Department of Computer Sciences, University of Texas at Austin

 

Collections: Computer Technologies and Information Sciences