Authors: Jian Tang; Mikel Larrea; Sergio Arévalo; Ernesto Jiménez
Addresses: Distributed Systems Laboratory (LSD), Technical University of Madrid, 28031 Madrid, Spain ' Facultad de Informática, University of the Basque Country UPV/EHU, 20018 San Sebastián, Spain ' Escuela Técnica Superior de Ingeniería de Sistemas Informáticos, Technical University of Madrid, 28031 Madrid, Spain ' Escuela Técnica Superior de Ingeniería de Sistemas Informáticos, Technical University of Madrid, 28031 Madrid, Spain; Escuela Politécnica Nacional (EPN), 17012759, Quito, Ecuador
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.
Keywords: anonymous distributed system; asynchronous system; reliable broadcast; fair lossy communication channels; failure detector; quiescent.
International Journal of High Performance Computing and Networking, 2017 Vol.10 No.4/5, pp.289 - 297
Available online: 18 Aug 2017 *Full-text access for editors Access for subscribers Purchase this article Comment on this article