Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
From MaRDI portal
Publication:990091
DOI10.1016/J.IPL.2009.09.013zbMath1206.68060OpenAlexW2132163014MaRDI QIDQ990091
Publication date: 2 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.09.013
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (1)
Cites Work
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- Bounded cost algorithms for multivalued consensus using binary consensus instances
- Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
- A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
- Structured derivations of consensus algorithms for failure detectors
- Impossibility of distributed consensus with one faulty process
- Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
- The weakest failure detector for solving consensus
- Distributed Computing
- The weakest failure detectors to solve certain fundamental problems in distributed computing
This page was built for publication: Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
