Probabilistic latency for partial ordering - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Probabilistic latency for partial ordering

Résumé

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.
Fichier principal
Vignette du fichier
article_fr_ieee.pdf (246.79 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01215016 , version 1 (30-11-2015)

Licence

Paternité

Identifiants

Citer

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⟩
288 Consultations
251 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More