Synchronous consensus under hybrid process and link failures
DOI10.1016/J.TCS.2010.09.032zbMATH Open1223.68018DBLPjournals/tcs/BielySW11OpenAlexW2010075998WikidataQ38762810 ScholiaQ38762810MaRDI QIDQ719299FDOQ719299
Authors: Martin Biely, Ulrich Schmid, 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
Recommendations
authenticationByzantine agreementlink failuresfault-tolerant distributed systemshybrid failure modelsuniform consensus
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Authenticated Algorithms for Byzantine Agreement
- The Byzantine Generals Problem
- The Byzantine generals strike again
- Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
- The Heard-Of model: computing in distributed systems with benign faults
- Failure detection and consensus in the crash-recovery model
- Distributed agreement in the presence of processor and communication faults
- New hybrid fault models for asynchronous approximate agreement
- Uniform consensus is harder than consensus
- Agreement in synchronous networks with ubiquitous faults
- Impossibility Results and Lower Bounds for Consensus under Link Failures
- Time is not a healer (preliminary version)
- Tolerating corrupted communication
- Synchronous consensus under hybrid process and link failures
- A new solution for the Byzantine generals problem
- Operating systems. An advanced course
- The customizable fault/error model for dependable distributed systems.
- Exploiting omissive faults in synchronous approximate agreement
- Atomic broadcast: From simple message diffusion to Byzantine agreement
- Orthogonal accuracy clock synchronization
- Title not available (Why is that?)
- 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
Cited In (16)
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- The Synchronous Condition-Based Consensus Hierarchy
- Eliminating message counters in synchronous threshold automata
- Consensus in rooted dynamic networks with short-lived stability
- Impossibility Results and Lower Bounds for Consensus under Link Failures
- Tutorial on parameterized model checking of fault-tolerant distributed algorithms
- On the impact of link faults on Byzantine agreement
- Synchronous consensus under hybrid process and link failures
- Reconciling fault-tolerant distributed algorithms and real-time computing
- Title not available (Why is that?)
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
- Asynchronous Byzantine reliable broadcast with a message adversary
- Round-Oblivious Stabilizing Consensus in Dynamic Networks
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures
- The time complexity of consensus under oblivious message adversaries
- Of choices, failures and asynchrony: the many faces of set agreement
This page was built for publication: Synchronous consensus under hybrid process and link failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719299)
