Uniform reliable broadcast in anonymous distributed systems with fair lossy channels
DOI10.1007/S00607-020-00825-6zbMATH Open1442.68015OpenAlexW3035629447MaRDI QIDQ2199064FDOQ2199064
Mikel Larrea, Ernesto Jiménez, Sergio Arévalo, Jian Tang
Publication date: 16 September 2020
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-020-00825-6
fault-tolerancequiescenceasynchronous systemanonymous systemfailure detectormessage passinguniform reliable broadcastfair lossy channel
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- Unreliable failure detectors for reliable distributed systems
- Introduction to Reliable and Secure Distributed Programming
- Anonymous and fault-tolerant shared-memory computing
- Anonymous Asynchronous Systems: The Case of Failure Detectors
- On the importance of having an identity or, is consensus really universal?
- A Generalized Birthday Problem
- Fault-tolerant broadcasts
- Assigning labels in an unknown anonymous network with a leader
- Anonymity-preserving failure detectors
- On Quiescent Reliable Communication
- Secure Multi-party Shuffling
Cited In (2)
This page was built for publication: Uniform reliable broadcast in anonymous distributed systems with fair lossy channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199064)