Probabilistic Causal Message Ordering
Causal broadcast is a classical communication primitive that has been studied for more then three decades and several implementations have been proposed. The implementation of such a primitive has a non negligible cost either in terms of extra information messages have to carry or in time delays needed for the delivery of messages. It has been proved that messages need to carry a control information the size of which is linear with the size of the system. This problem has gained more interest due to new application domains such that collaborative applications are widely used and are becoming massive and social semantic web and linked-data the implementation of which needs causal ordering of messages. This paper proposes a probabilistic but efficient causal broadcast mechanism for large systems with changing membership that uses few integer timestamps.
KeywordsAsynchronous message-passing system Happened before relation Logical clock Message causal ordering Vector clock
This work has been partially supported by the Franco-German DFG-ANR Project DISCMAT (40300781) devoted to connections between mathematics and distributed computing, and the French ANR project O’Browser (ANR-16-CE25-0005-01) devoted to decentralized computing on networks of browsers.
- 1.Alvaro, P., Conway, N., Hellerstein, J.M., Marczak, W.R.: Consistency analysis in bloom: a CALM and collected approach. In: Proceedings of the CIDR 2011, pp. 249–260 (2011)Google Scholar
- 5.Eugster, P.T., Guerraoui, R., Handurukande, S.B., Kouznetsov, P., Kermarrec, A.M.: Lightweight probabilistic broadcast. In: DSN, pp. 443–452 (2001)Google Scholar
- 9.Mattern, F.: Virtual time and global states of distributed systems. In: Proceedings of the International Workshop on Parallel and Distributed Algorithms, pp. 215–226 (1989)Google Scholar
- 10.Mostefaoui, A., Weiss, S.: A Probabilistic Causal Message Ordering Mechanism. Research report, Université de Nantes (2017). Open archive HAL ref. hal-01527110Google Scholar
- 11.Oster, G., Urso, P., Molli, P., Imine, A.: Data consistency for p2p collaborative editing. In: CSCW, pp. 259–268 (2006)Google Scholar
- 16.Terry, D., Demers, A., Petersen, K., Spreitzer, M., Theimer, M., Welch, B.: Session guarantees for weakly consistent replicated data. In: Proceedings of the PDIS, pp. 140–149 (1994)Google Scholar