Abstract
Reliable broadcast (RB) is a basic abstraction in distributed systems, because it allows processes to communicate consistently and reliably with each other. This abstraction has been extensively investigated in eponymous distributed systems (i.e., all processes have different identifiers) in contrast to the study in anonymous systems (i.e., all processes have no ID). Hence, this paper is aimed to study RB in anonymous distributed systems with fair lossy communication channels. Firstly, a non-quiescent RB algorithm tolerating an arbitrary number of crashed processes is given. Then, we introduce an anonymous perfect failure detector AP*. Finally, we propose an extended and quiescent RB algorithm using AP*, in which eventually no process sends messages.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
