Date Added: Apr 2010
In this paper, the authors consider the problem of maximizing the throughput of Byzantine agreement. Byzantine agreement is a classical problem in distributed computing, with initial solutions presented in the seminal work of Pease, Shostak and Lamport. Many variations on the Byzantine agreement problem have been introduced in the past, with some of the variations also called consensus. The authors will use the following definition of Byzantine agreement: consider a network with one node designated as the sender or source (S), and the other nodes designated as the peers.