Accession Number:

ADA555114

Title:

Complexity of Multi-Value Byzantine Agreement

Descriptive Note:

Technical rept.

Corporate Author:

ILLINOIS UNIV AT URBANA-CHAMPAIGN

Personal Author(s):

Report Date:

2010-06-11

Pagination or Media Count:

13.0

Abstract:

In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, given that the sum capacity of all links in between nodes in the system is finite. Byzantine agreement BA 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. We will use the following definition of Byzantine agreement Byzantine general problem Consider a network with one node designated as the sender or source S, and the other nodes designated as the peers. The goal of Byzantine agreement is for all the fault-free nodes to agree on the value being sent by the sender, despite the possibility that some of the nodes may be faulty. Our goal in this work is to design algorithms that can achieve optimal throughput of agreement.

Subject Categories:

  • Computer Programming and Software
  • Computer Systems
  • Computer Systems Management and Standards

Distribution Statement:

APPROVED FOR PUBLIC RELEASE