Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
Department of Computer ScienceThe Pennsylvania State University
Juan A. Garay
IBM T. J. Watson Research Center
Cite this article as:
Berman, P. & Garay, J.A. Math. Systems Theory (1993) 26: 3. doi:10.1007/BF01187072
TheDistributed Consensus problem involvesn processors each of which holds an initial binary value. At mostt processors may be faulty and ignore any protocol (even behaving maliciously), yet it is required that the nonfaulty processors eventually agree on a value that was initially held by one of them. We measure the quality of a consensus protocol using the following parameters; total number of processorsn, number of rounds of message exchanger, and maximal message sizem. The known lower bounds are respectively 3t + 1,t + 1, and 1.
While no known protocol is optimal in all these three aspects simultaneously,Cloture Votes—the protocol presented in this paper—takes further steps in this direction, by making consensus possible withn = 4t + 1,r = t + 1, and polynomial message size.
Cloture is a parliamentary procedure (also known as “parliamentary guillotine”) which makes it possible to curtail unnecessary long debates. In our protocol the unanimous will of the correct processors (akin to parliamentarian supermajority) may curtail the debate. This is facilitated by having the processors open in each round a new process (debate), which either ends quickly, with the conclusion “continue” or “terminate with the default value,” or lasts through many rounds. Importantly, in the latter case the messages being sent are short.