Total order multicast to multiple groups
- 22 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
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.Keywords
This publication has 14 references indexed in Scilit:
- The weakest failure detector for solving consensusJournal of the ACM, 1996
- From group communication to transactions in distributed systemsCommunications of the ACM, 1996
- Unreliable failure detectors for reliable distributed systemsJournal of the ACM, 1996
- A total ordering multicast protocol using propagation treesIEEE Transactions on Parallel and Distributed Systems, 1995
- Ordered and reliable multicast communicationACM Transactions on Computer Systems, 1991
- Lightweight causal and atomic group multicastACM Transactions on Computer Systems, 1991
- An efficient reliable broadcast protocolACM SIGOPS Operating Systems Review, 1989
- A new algorithm to implement causal orderingPublished by Springer Nature ,1989
- Reliable communication in the presence of failuresACM Transactions on Computer Systems, 1987
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978