Iterative Approximate Byzantine Consensus under a Generalized Fault Model

Abstract

In this work, we consider a generalized fault model that can be used to represent a wide range of failure scenarios, including correlated failures and non-uniform node reliabilities. This fault model is general in the sense that fault models studied in prior related work, such as f -total and f -local models, are special cases of the generalized fault model. Under the generalized fault model, we explore iterative approximate Byzantine consensus (IABC) algorithms in arbitrary directed networks. We prove a necessary and sufficient condition for the existence of IABC algorithms. The use of the generalized fault model helps to gain a better understanding of IABC algorithms.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 21, 2012
Accession Number
ADA564090

Entities

People

  • Lewis Tseng
  • Nitin H. Vaidya

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Asynchronous Systems
  • Communication Networks
  • Computer Science
  • Consensus Algorithms
  • Construction
  • Convergence
  • Decomposition
  • Information Operations
  • Intervals
  • Iterations
  • Materials
  • Mathematics
  • Network Topology
  • Networks
  • Reliability
  • Transitions

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computational Modeling and Simulation
  • Operations Research