Total order multicast to multiple groups

Author

Guerraoui, Rachid ; Schiper, André

Author_Institution

Dept. d´´Inf., Ecole Polytech. Federale de Lausanne, Switzerland

fYear

1997

fDate

27-30 May 1997

Firstpage

578

Lastpage

585

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

distributed algorithms; message passing; program verification; software fault tolerance; algorithm correctness; causal order message delivery; failure detectors; fault tolerance; fault tolerant algorithm; multicast algorithm; multiple groups; multiple process groups; total order delivery; total order multicast; unreliable failure detectors; Broadcasting; Computer crashes; Contracts; Detectors; Fault detection; Fault tolerance; Fault tolerant systems; Liver; Multicast algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Computing Systems, 1997., Proceedings of the 17th International Conference on

Conference_Location

Baltimore, MD

ISSN

1063-6927

Print_ISBN

0-8186-7813-5

Type

conf

DOI

10.1109/ICDCS.1997.603426

Filename

603426