Exact Byzantine Consensus in Directed Graphs

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 04, 2012
Accession Number
ADA568111

Entities

People

  • Lewis Tseng
  • Nitin H. Vaidya

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Agreements
  • Algorithms
  • Communication Channels
  • Communication Networks
  • Computer Science
  • Computers
  • Consensus Algorithms
  • Decomposition
  • Illinois
  • Information Operations
  • Iterations
  • Mathematics
  • Military Research
  • Network Topology
  • Networks
  • Observation

Fields of Study

  • Mathematics