Abstract
|
|
---|---|
Fault-tolerant broadcast is a fundamental service in distributed systems, by which processes can communicate with each other consistently and reliably. It has two main forms: Reliable Broadcast (RB) and Uniform Reliable Broadcast(URB). This service has been extensively investigated in non-anonymous distributed systems where processes have unique identi?ers, usually assume the communication chan- nels are reliable, which is not always the case in real systems. In this paper, the fault-tolerant broadcast service is studied in an anonymous asynchronous message passing distributed system model with fair lossy communication chan- nels. Firstly, two simple and non-quiescent algorithms implementing RB and URB are given. Secondly, two new classes of failure detectors A? and AP? are proposed. Finally, with the information provided by A? and AP?, quiescent algorithms for both RB and URB are given. | |
International
|
Si |
Congress
|
34th Annual ACM Symposium on Principles of Distributed Computing |
|
960 |
Place
|
San Sebastián |
Reviewers
|
Si |
ISBN/ISSN
|
978-1-4503-3617-8 |
|
10.1145/2767386.2767443 |
Start Date
|
21/07/2015 |
End Date
|
23/07/2015 |
From page
|
203 |
To page
|
205 |
|
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing |