Total order multicast to multiple groups

We present a fault tolerant algorithm that ensures total order delivery of messages sent to multiple groups of processes. Our algorithm is a multiple group "genuine" multicast algorithm in the sense that: (1) any process can send a message to any set of process groups; and (2) only the sender and the receivers of a message take part in the algorithm needed to deliver the message. The correctness of our algorithm does not require reliable failure detectors, but requires causal order delivery of messages. This establishes a new and interesting link between causal order delivery and fault tolerance with unreliable failure detectors.

[1]  Virgil D. Gligor,et al.  A fault-tolerant protocol for atomic broadcast , 1988, Proceedings [1988] Seventh Symposium on Reliable Distributed Systems.

[2]  Pat Stephenson.  Fast Ordered Multicasts , 1991 .

[3]  Andrew S. Tanenbaum,et al.  Distributed operating systems , 2009, CSUR.

[4]  Ajei Sarat Gopal.  Fault-tolerant broadcasts and multicasts: the problem of inconsistency and contamination , 1992 .

[5]  Flaviu Cristian,et al.  Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement , 1995, Inf. Comput..

[6]  Danny Dolev,et al.  Early delivery totally ordered multicast in asynchronous environments , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.

[7]  Kenneth P. Birman,et al.  Reliable communication in the presence of failures , 1987, TOCS.

[8]  Sam Toueg,et al.  Fault-tolerant broadcasts and related problems , 1993 .

[9]  André Schiper,et al.  Lightweight causal and atomic group multicast , 1991, TOCS.

[10]  K. Mani Chandy,et al.  How processes learn , 1985, PODC '85.

[11]  Newtop: a fault-tolerant group communication protocol , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

[12]  Xiaohua Jia.  A Total Ordering Multicast Protocol Using Propagation Trees , 1995, IEEE Trans. Parallel Distributed Syst..

[13]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1992, PODC '92.

[14]  André Schiper,et al.  A New Algorithm to Implement Causal Ordering , 1989, WDAG.

[15]  Hector Garcia-Molina,et al.  Ordered and reliable multicast communication , 1991, TOCS.

[16]  André Schiper,et al.  From group communication to transactions in distributed systems , 1996, CACM.

[17]  Louise E. Moser,et al.  The Totem single-ring ordering and membership protocol , 1995, TOCS.

[18]  Jo-Mei Chang,et al.  Reliable broadcast protocols , 1984, TOCS.

[19]  André Schiper,et al.  A hierarchy of totally ordered multicasts , 1995, Proceedings. 14th Symposium on Reliable Distributed Systems.

[20]  Henri E. Bal,et al.  An efficient reliable broadcast protocol , 1989, OPSR.

[21]  R. Guerraoui,et al.  Atomic Multicast harder than Atomic Broadcast , 1996 .

[22]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[23]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.