FIFO and Atomic broadcast algorithms with bounded message size for dynamic systems - Archive ouverte HAL Access content directly
Conference Papers Year : 2021

FIFO and Atomic broadcast algorithms with bounded message size for dynamic systems

Abstract

FIFO broadcast provides application ordering semantics of messages broadcast by the same sender and have been mostly implemented on top of unreliable static networks. In this article, we propose a round-based FIFO broadcast algorithm with both termination detection and bounded message size for dynamic networks with recurrent connectivity (Class TC^R of Time-varying Graph formalism). Initially, processes only know the number of processes N in the system and their identifier. Due to the dynamics of the network links, messages can be lost. Since no unbounded timestamp is used to identify a message, its size is bounded to 2N + O(log(N)) + msgSize bits where msgSize is the bound size in bits of the broadcast data. We also present an FIFO atomic broadcast algorithm in Class TC^R that uses the proposed FIFO broadcast and deliver primitives.
Fichier principal
Vignette du fichier
srds-2021.pdf (418.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03332423 , version 1 (02-09-2021)

Identifiers

  • HAL Id : hal-03332423 , version 1

Cite

Colette Johnen, Luciana Arantes, Pierre Sens. FIFO and Atomic broadcast algorithms with bounded message size for dynamic systems. SRDS 2021 - 40th International Symposium on Reliable Distributed Systems, Sep 2021, Chicago / Virtual, United States. ⟨hal-03332423⟩
142 View
396 Download

Share

Gmail Facebook X LinkedIn More