Preserving and using context information in interprocess communication
ACM Transactions on Computer Systems (TOCS)
An efficient reliable broadcast protocol
ACM SIGOPS Operating Systems Review
Fault tolerance using group communication
ACM SIGOPS Operating Systems Review
Ordered and reliable multicast communication
ACM Transactions on Computer Systems (TOCS)
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A sequencing service for group communication
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
A formal method to prove ordering properties of multicast systems
ACM SIGOPS Operating Systems Review
Partial order relations in distributed object environments
ACM SIGOPS Operating Systems Review
An Object Communication Architecture for Real-Time Distributed Process Control
ECOOP '97 Proceedings of the Workshops on Object-Oriented Technology
EventJava: An Extension of Java for Event Correlation
Genoa Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming
| Hi-index | 0.00 |
Multicast protocols must often provide a given property on the order in which messages are delivered. This delivery order may be consistent with local dependences between messages or with causal dependences. A local delivery is defined according to the emitting order observed at the same process source. A causal delivery is defined according to the causal relations observed between different emitting events. If an arbitrary delivery order is applied (when there are no particular dependences) the multicast is said to be totally ordered. In this paper we study totally and causally ordered multicast protocols i.e. multicast protocols that guarantee a total order conforming with the causal dependences. We propose a new method that begins to build a total order to obtain a causal and total multicast, when all current methods propose to build first a causal order then a total order (developed using the services of this causal layer).This new approach results from a formal study of ordering properties. In the first main result we show that a broadcast that guarantees a local and total order also provides a causal broadcast. Then we show that a multicast protocol that guarantees a local and a total order with additional constraints is also a causal and total multicast. This result makes no assumption about structure of overlapping groups. We finally develop the scheme of a multicast protocol using a centralized server of order. This solution is efficient in terms of messages and delay for a small number of sites. It allows all types of messages (unicast, multicast, broadcast) to mix while getting a causal and total ordering.