Synchronous consensus under hybrid process and link failures
From MaRDI portal
Publication:719299
DOI10.1016/j.tcs.2010.09.032zbMath1223.68018WikidataQ38762810 ScholiaQ38762810MaRDI QIDQ719299
Ulrich Schmid, Martin Biely, Bettina Weiss
Publication date: 10 October 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.032
authentication; Byzantine agreement; link failures; fault-tolerant distributed systems; hybrid failure models; uniform consensus
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms, Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker, Asynchronous Byzantine reliable broadcast with a message adversary, On the impact of link faults on Byzantine agreement, Synchronous consensus under hybrid process and link failures, Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks, Consensus in rooted dynamic networks with short-lived stability, Eliminating message counters in synchronous threshold automata, Reconciling fault-tolerant distributed algorithms and real-time computing, Of choices, failures and asynchrony: the many faces of set agreement
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synchronous consensus under hybrid process and link failures
- Operating systems. An advanced course
- The customizable fault/error model for dependable distributed systems.
- Atomic broadcast: From simple message diffusion to Byzantine agreement
- The Heard-Of model: computing in distributed systems with benign faults
- Agreement in synchronous networks with ubiquitous faults
- Round-by-round fault detectors (extended abstract)
- Authenticated Algorithms for Byzantine Agreement
- Exploiting omissive faults in synchronous approximate agreement
- Impossibility Results and Lower Bounds for Consensus under Link Failures
- A new solution for the Byzantine generals problem
- Distributed agreement in the presence of processor and communication faults
- The Byzantine Generals Problem
- The Byzantine generals strike again
- New hybrid fault models for asynchronous approximate agreement
- Uniform consensus is harder than consensus
- Time is not a healer
- Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
- How to reconcile fault-tolerant interval intersection with the Lipschitz condition
- A tradeoff between safety and liveness for randomized coordinated attack protocols
- A formally verified algorithm for clock synchronization under a hybrid fault model
- Tolerating corrupted communication