Parameter-independent Iterative Approximate Byzantine Consensus

Abstract

In this work, we explore iterative approximate Byzantine consensus algorithms that do not make explicit use of the global parameter of the graph, i.e., the upper-bound on the number of faults, f .

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 23, 2012
Accession Number
ADA564307

Entities

People

  • Lewis Tseng
  • Nitin H. Vaidya

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Communication Networks
  • Computer Science
  • Computers
  • Consensus Algorithms
  • Convergence
  • Illinois
  • Information Operations
  • Intervals
  • Iterations
  • Mathematics
  • Network Topology
  • Networks
  • Sequences
  • Specifications

Fields of Study

  • Mathematics