On the many faces of atomic multicast

The second algorithm we presented is not genuine but requires perfect failure detection inside each group only and may deliver messages addressed to multiple groups within

We establish the inherent cost of the genuine atomic multicast problem for messages that are multicast to multiple groups and we show that quiescence has a cost, i.e., in runs where

i sends a recon-get RPC to each node in config asking for its current object value and tag, waits for a majority of replicas to respond, and uses the most up-to-date response as

In [7], inside each group g, processes implement a log- ical clock that is used to generate timestamps; consensus is used among processes in g to maintain g’s clock. Every

We take a Gilbert-Elliot (GE) model to capture the error characteristics of a fading channel and we provide an analytical study of the performance of FEC for multicast

›YdkFRQˆMBFRd M…D^QfX qf` QTS…hfO_XG› QTMœHKVfSBM ¦VYdiQTPWLNF§•^JGFRdkONFWSMiVfMmQTLNO_XG› QTMœHKVfSBM

Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unit´e de recherche INRIA Rhˆone-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des