The real Byzantine Generals

  title={The real Byzantine Generals},
  author={K. Driscoll and B. Hall and M. Paulitsch and P. Zumsteg and H. Sivencrona},
  journal={The 23rd Digital Avionics Systems Conference (IEEE Cat. No.04CH37576)},
In contrast to previous papers on the Byzantine Generals problem, this work examines the problem from a practical, lower-level, phenomena point of view. The goal is to dispel a common belief that the problem is a myth (potentially arising from the anthropomorphic nature of previous literature). This work gives practical, succinct definitions for Byzantine fault and failure. It describes how these arise and are propagated in electrical signals and "digital" circuitry. The paper describes actual… Expand
An Effective Solution for the Byzantine Agreement Problem through Lamport-Shostak-Pease Algorithm
Distributed computing systems consisting of several computers that do not share a memory or a clock, the computers communicate with each other by exchanging messages over a communication network. ToExpand
Achieving fault tolerance via robust partitioning and N-Modular Redundancy
This thesis describes the design and performance results for the P-NMR fault tolerant avionics system architecture being developed at Draper Laboratory. The two key principles of the architecture areExpand
It is shown that ByRDiE can provably tolerate Byzantine failures in the network under certain assumptions on the network topology and the machine learning tasks and numerical results reported in the paper confirm the robustness of ByR DiE to Byzantine failures. Expand
IGOR: Accelerating Byzantine Fault Tolerance for Real-Time Systems with Eager Execution
IGOR is a new speculative BFTSMR approach that leverages multi-core processors to avoid the added latency inherent to traditional BFT SMR techniques in both the absence and presence of faults and noticeably increases vehicle stability. Expand
Coverage and the use of cyclic redundancy codes in ultra-dependable systems
This paper identifies some examples of CRC usage that compromise ultra-dependable system design goals, and recommends alternate ways to improve system dependability via architectural approaches rather than error detection coding approaches. Expand
Semi-Fast Byzantine-tolerant Shared Register without Reliable Broadcast
This paper implements an efficient multi-writer multi-reader safe register without using a reliable broadcast primitive and provides fast reads or one-shot reads, and proves a tight bound on the number of servers required to implement Byzantine-fault tolerant safe registers in a system without reliable broadcast. Expand
Safety-Critical Communication in Avionics
The aircraft of today use electrical fly-by-wire systems for manoeuvring. These safety-critical distributed systems are called flight control systems and put high requirements on the communicationExpand
Fault-tolerant High-Performance Clock Distribution
We consider low-degree clock distribution grids that are resilient to failures of a fraction of its nodes and have the ability to recover from an unbounded number of transient faults. In [1] Dolev etExpand
ByRDiE: Byzantine-Resilient Distributed Coordinate Descent for Decentralized Learning
  • Zhixiong Yang, W. Bajwa
  • Computer Science, Mathematics
  • IEEE Transactions on Signal and Information Processing over Networks
  • 2019
This paper focuses on the problem of Byzantine failures, which are the hardest to safeguard against in distributed algorithms, and develops and analyzes an algorithm termed Byzantine-resilient distributed coordinate descent that enables distributed learning in the presence of Byzantine fails. Expand
A ug 2 01 9 BRIDGE : Byzantine-resilient Decentralized Gradient Descent
Decentralized optimization techniques are increasingly being used to learn machine learning models from data distributed over multiple locations without gathering the data at any one location.Expand


The Byzantine Generals Problem
It is shown that, using only oral messages, the problem of a group of generals camped with their troops around an enemy city is solvable if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals. Expand
Practical Byzantine fault tolerance
A new replication algorithm that is able to tolerate Byzantine faults that works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude. Expand
Formally verified Byzantine agreement in presence of link faults
This paper shows that deterministic consensus in synchronous distributed systems with link faults is possible, despite the impossibility result of Gray (1978), and moderately restricting the inconsistency that link faults may cause system-wide. Expand
Efficient Byzantine-resilient reliable multicast on a hybrid failure model
A new reliable multicast protocol that tolerates arbitrary faults, including Byzantine faults, is presented, developed using a novel way of designing secure protocols which is based on a well-founded hybrid failure model. Expand
FTMP—A highly reliable fault-tolerant multiprocess for aircraft
The core software in the FFMP will handle all fault detection, diagnosis, and recovery in such a way that applications programs do not need to be involved. Expand
SIFT: Design and analysis of a fault-tolerant computer for aircraft control
SIFT (Software Implemented Fault Tolerance) is an ultrareliable computer for critical aircraft control applications that achieves fault tolerance by the replication of tasks among processing units by using a novel fault-tolerant synchronization method. Expand
A conceptual design for a Reliable Optical Bus (ROBUS)
The SPIDER is a general-purpose computational platform suitable for use in ultrareliable embedded control applications and the conceptual design of the ROBUS is presented in this paper including requirements, topology, protocols, and the block-level design. Expand
Real-Time Systems - Design Principles for Distributed Embedded Applications
  • H. Kopetz
  • Computer Science, Engineering
  • Real-Time Systems Series
  • 1997
Real-Time Systems offers a splendid example for the balanced, integrated treatment of systems and software engineering, helping readers tackle the hardest problems of advanced real-time system design, such as determinism, compositionality, timing and fault management. Expand
Heavy-Ion Fault Injections in the Time-Triggered Communication Protocol
The experimental results show that arbitrary faults in one node can cause inconsistencies in the cluster and jeopardize the operation of correctly working nodes and the whole cluster, and it seems to be important to further analyze if and why cluster sizes need to be taken into account when validating distributed systems. Expand
Beyond the byzantine generals: unexpected behavior and bridging fault diagnosis
A diagnosis procedure that uses modified composite signatures constructed from single stuck-at information combined with a lexicographic matching and ranking algorithm to perform high-quality bridging fault diagnosis for diagnostic experiments involving dropping or adding behaviors from the simulations of faulty circuits. Expand