Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures
From MaRDI portal
Publication:6161036
DOI10.1007/s00607-022-01135-9zbMath1522.68067MaRDI QIDQ6161036
José Luis López-Presa, Ernesto Jiménez, Marta Patiño-Martínez
Publication date: 2 June 2023
Published in: Computing (Search for Journal in Brave)
consensuscrash failuresatomic broadcastsynchronous distributed systemsanonymous systemsunknown maximum number of failuresunknown size of membership
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Anonymous asynchronous systems: the case of failure detectors
- A lower bound for the time to assure interactive consistency
- A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
- A classification of total order specifications and its application to fixed sequencer-based implementations
- Computation in networks of passively mobile finite-state sensors
- Authenticated Algorithms for Byzantine Agreement
- Impossibility of distributed consensus with one faulty process
- Computing on an anonymous ring
- Unreliable failure detectors for reliable distributed systems
- Brief Announcement: Byzantine Agreement with Unknown Participants and Failures
