Probabilistic latency for partial ordering

Pascal Urso 1 Jordi Martori 1
1 COAST - Web Scale Trustworthy Collaborative Service Systems
Inria Nancy - Grand Est, LORIA - NSS - Department of Networks, Systems and Services
Abstract : Ordering events in a distributed systems consists fundamentally in delaying event delivery. Partial ordering, such as FIFO and causal order, has many practical usages in distributed systems and can be obtained in arbitrarily large and dynamic networks. However, partial orderings imply that messages cannot be sent and delivered as soon as produced. In this paper, we examine the latency induced by such partial orderings. We obtain a probabilistic measure of the moment a message can be delivered according the different characteristics of the distributed system. Having such a measure helps to understand the systems behavior and to design new protocols. For instance, our measure allows us to parametrize a naive, albeit efficient, fault-tolerant causal delivery mechanism. We experimentally validate our approach using Internet-scale production distribution latency including faults.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download
Contributor : Jordi Martori <>
Submitted on : Monday, November 30, 2015 - 3:07:35 PM
Last modification on : Tuesday, December 18, 2018 - 4:26:02 PM
Long-term archiving on : Thursday, April 27, 2017 - 12:23:48 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License




Pascal Urso, Jordi Martori. Probabilistic latency for partial ordering. Protocol Engineering (ICPE) and International Conference on New Technologies of Distributed Systems (NTDS), Jul 2015, Paris, France. ⟨10.1109/NOTERE.2015.7293483⟩. ⟨hal-01215016⟩



Record views


Files downloads