Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Efficient atomic broadcast using deterministic merge
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Genuine atomic multicast in asynchronous distributed systems
Theoretical Computer Science
Ruminations on Domain-Based Reliable Broadcast
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Fault-Tolerant Total Order Multicast to Asynchronous Groups
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Optimistic Total Order in Wide Area Networks
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
An Indulgent Uniform Total Order Algorithm with Optimistic Delivery
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Early consensus in an asynchronous system with a weak failure detector
Distributed Computing
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
Solving Atomic Multicast When Groups Crash
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
| Hi-index | 0.00 |
In this paper, we study the atomic broadcast and multicast problems, two fundamental abstractions for building fault-tolerant systems. As opposed to atomic broadcast, atomic multicast allows messages to be addressed to a subset of the processes in the system, each message possibly being multicast to a different subset. Our study focuses on wide area networks where groups of processes, i.e., processes physically close to each other, are inter-connected through high latency communication links. In this context, we capture the cost of algorithms, denoted latency degree, as the minimum number of inter-group message delays between the broadcasting (multicasting) of a message and its delivery. We present an atomic multicast algorithm with a latency degree of two and show that it is optimal. We then present the first fault-tolerant atomic broadcast algorithm with a latency degree of one. To achieve such a low latency, the algorithm is proactive, i.e., it may take actions even though no messages are broadcast. Nevertheless, it is quiescent: provided that the number of broadcast messages is finite, the algorithm eventually ceases its operation.