Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Ordered and reliable multicast communication
ACM Transactions on Computer Systems (TOCS)
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
The Totem single-ring ordering and membership protocol
ACM Transactions on Computer Systems (TOCS)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
From group communication to transactions in distributed systems
Communications of the ACM
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
IEEE Transactions on Knowledge and Data Engineering
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
Semi-passive replication and Lazy Consensus
Journal of Parallel and Distributed Computing
Throughput optimal total order broadcast for cluster environments
ACM Transactions on Computer Systems (TOCS)
| Hi-index | 0.01 |
While Total Order Broadcast (or Atomic Broadcast ) primitives have received a lot of attention, this paper concentrates on Total Order Multicast to Multiple Groups in the context of asynchronous distributed systems in which processes may suffer crash failures. 驴Multicast to Multiple Groups驴 means that each message is sent to a subset of the process groups composing the system, distinct messages possibly having distinct destination groups. 驴Total Order驴 means that all message deliveries must be totally ordered. This paper investigates a consensus-based approach to solve this problem and proposes a corresponding protocol to implement this multicast primitive. This protocol is based on two underlying building blocks, namely, Uniform Reliable Multicast and Uniform Consensus. Its design characteristics lie in the two following properties: The first one is a Minimality property, more precisely, only the sender of a message and processes of its destination groups have to participate in the total order multicast of the message. The second property is a Locality property: No execution of a consensus has to involve processes belonging to distinct groups (i.e., consensus is executed on a 驴per group驴 basis). This Locality property is particularly useful when one is interested in using the Total Order Multicast primitive in large-scale distributed systems. In addition to a correctness proof, an improvement that reduces the cost of the protocol is also suggested.