Accession Number:

ADA568111

Title:

Exact Byzantine Consensus in Directed Graphs

Descriptive Note:

Technical rept.

Corporate Author:

ILLINOIS UNIV AT URBANA-CHAMPAIGN DEPT OF COMPUTER SCIENCE

Personal Author(s):

• Tseng, Lewis
• Vaidya, Nitin

Report Date:

2012-09-04

Pagination or Media Count:

32.0

Abstract:

For synchronous point-to-point n-node networks of undirected links, it has been previously shown that, to achieve consensus in presence of up to f Byzantine faults, the following two conditions are together necessary and sufficient.

Descriptors:

• *GRAPHS
• NETWORKS
• NODES

Subject Categories:

• Statistics and Probability

Distribution Statement:

APPROVED FOR PUBLIC RELEASE