Total Order Multicast to Multiple Groups

Authors:
Rachid Guerraoui;Andre Schiper
Affiliations:
-;-
Venue:
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Year:
1997

Citing 0
Cited 4

The Generic Consensus Service

IEEE Transactions on Software Engineering
Consensus-based fault-tolerant total order multicast

IEEE Transactions on Parallel and Distributed Systems
Consensus in Asynchronous Distributed Systems: A Concise Guided Tour

Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
Optimistic algorithms for partial database replication

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

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.