Accession Number : ADA555086
Title : Capacity of Byzantine Agreement: Tight Bound for the Four Node Network
Descriptive Note : Technical rept.
Corporate Author : ILLINOIS UNIV AT URBANA DEPT OF ELECTRICAL AND COMPUTER ENGINEERING
Personal Author(s) : Liang, Guanfeng ; Vaidya, Nitin
Report Date : 01 Feb 2010
Pagination or Media Count : 23
Abstract : In this report, we 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. There has also been more recent work on designing multicast algorithms that can survive Byzantine attacks. Many variations on the Byzantine agreement problem have been introduced in the past, with some of the variations also called consensus. We will use the original definition of Byzantine agreement in our discussion. In particular, we consider a network with one node designated as the sender or source, and other nodes designated as the peers. The goal here is for all the fault-free nodes to agree on the value being sent by the sender.
Descriptors : *COMPUTER NETWORKS , *DISTRIBUTED COMPUTING , ALGORITHMS , NODES , THROUGHPUT
Subject Categories : Computer Systems
Computer Systems Management and Standards
Distribution Statement : APPROVED FOR PUBLIC RELEASE