Skip to Main content Skip to Navigation
New interface
Journal articles

On the Versatility of Bracha’s Byzantine Reliable Broadcast Algorithm

Michel Raynal 1 
1 WIDE - the World Is Distributed Exploring the tension between scale and coordination
Inria Rennes – Bretagne Atlantique , IRISA-D1 - SYSTÈMES LARGE ÉCHELLE
Abstract : G. Bracha presented in 1987 a simple and efficient reliable broadcast algorithm for [Formula: see text]-process asynchronous message-passing systems, which tolerates up to [Formula: see text] Byzantine processes. Following an idea recently introduced by Hirt, Kastrato and Liu-Zhang (OPODIS 2020), instead of considering the upper bound on the number of Byzantine processes [Formula: see text], the present short article considers two types of Byzantine behavior: the ones that can prevent the safety property from being satisfied, and the ones that can prevent the liveness property from being satisfied (a Byzantine process can exhibit only one or both types of failures). This Byzantine differentiated failure model is captured by two associated upper bounds denoted [Formula: see text] (for safety) and [Formula: see text] for liveness). The article shows that only the threshold values used in the predicates of Bracha’s algorithm must be modified to obtain an algorithm that works with this differentiated Byzantine failure model.
Complete list of metadata
Contributor : François Taïani Connect in order to contact the contributor
Submitted on : Friday, September 17, 2021 - 6:12:51 PM
Last modification on : Tuesday, October 25, 2022 - 4:23:18 PM
Long-term archiving on: : Saturday, December 18, 2021 - 7:12:29 PM


Files produced by the author(s)



Michel Raynal. On the Versatility of Bracha’s Byzantine Reliable Broadcast Algorithm. Parallel Processing Letters, 2021, 31 (03), pp.1-7. ⟨10.1142/S0129626421500067⟩. ⟨hal-03347874⟩



Record views


Files downloads