Uniform reliable broadcast in anonymous distributed systems with fair lossy channels
From MaRDI portal
Publication:2199064
DOI10.1007/s00607-020-00825-6zbMath1442.68015OpenAlexW3035629447MaRDI QIDQ2199064
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-tolerancemessage passingquiescenceasynchronous systemanonymous systemfailure detectoruniform reliable broadcastfair lossy channel
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Unnamed Item
- Fault-tolerant broadcasts
- Anonymity-preserving failure detectors
- On the importance of having an identity or, is consensus really universal?
- Anonymous and fault-tolerant shared-memory computing
- Introduction to Reliable and Secure Distributed Programming
- Secure Multi-party Shuffling
- Anonymous Asynchronous Systems: The Case of Failure Detectors
- Unreliable failure detectors for reliable distributed systems
- On Quiescent Reliable Communication
- Assigning labels in an unknown anonymous network with a leader
- A Generalized Birthday Problem
This page was built for publication: Uniform reliable broadcast in anonymous distributed systems with fair lossy channels