Causal multicasts in overlapping groups : towards a low cost approach

Achour Mostefaoui 1 Michel Raynal 1
1 ADP - Distributed Algorithms and Protocols
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : Concepts of group (to structure processes) and causality (to structure sendings and deliveries of messages) are of major importance in the design of distributed systems. Mixing both concepts, the ISIS system defined causal multicast in overlapping groups. This paper presents a simple and efficient protocol that implements such causal multicasts. It compares favourably with the ISIS protocol as it uses only one vector of integers (size of this vector being the total number of groups) to timestamp messages. This low cost in the size of timestamps is obtained by using (sometimes) additional resynchronization messages. It is shown that there is a trade-off between the "as early as possible delivery time" criterium and the "as small as possible timestamps size" criterium for timestamp-based protocols implementing causal order.
Type de document :
[Research Report] RR-1871, INRIA. 1993
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 16:27:21
Dernière modification le : mercredi 16 mai 2018 - 11:23:02
Document(s) archivé(s) le : mardi 12 avril 2011 - 19:25:46



  • HAL Id : inria-00074802, version 1


Achour Mostefaoui, Michel Raynal. Causal multicasts in overlapping groups : towards a low cost approach. [Research Report] RR-1871, INRIA. 1993. 〈inria-00074802〉



Consultations de la notice


Téléchargements de fichiers