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

Colette Johnen (1, 2) , Luciana Arantes (2) , Pierre Sens (2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 DELYS - DistributEd aLgorithms and sYStems

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.

Mots clés: Theory of computation; Distributed algorithms; dynamic graphs; communication primitive; FIFO broadcast; Causal Broadcast; Atomic Broadcast; bounded message size

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

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⟩