Practical Byzantine Reliable Broadcast on Partially-Connected Networks

Conference Paper (2021)
Author(s)

Silvia Bonomi (Sapienza University of Rome)

Jérémie Decouchant (TU Delft - Data-Intensive Systems)

Giovanni Farina (Sapienza University of Rome)

Vincent Rahli (University of Birmingham)

Sébastien Tixeuil (Sorbonne Université, Paris)

Research Group
Data-Intensive Systems
Copyright
© 2021 Silvia Bonomi, Jérémie Decouchant, Giovanni Farina, Vincent Rahli, Sébastien Tixeuil
DOI related publication
https://doi.org/10.1109/ICDCS51616.2021.00055
More Info
expand_more
Publication Year
2021
Language
English
Copyright
© 2021 Silvia Bonomi, Jérémie Decouchant, Giovanni Farina, Vincent Rahli, Sébastien Tixeuil
Research Group
Data-Intensive Systems
Pages (from-to)
506-516
ISBN (electronic)
978-1-6654-4513-9
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

In this paper, we consider the Byzantine reliable broadcast problem on authenticated and partially connected networks. The state-of-the-art method to solve this problem consists in combining two algorithms from the literature. Handling asynchrony and faulty senders is typically done thanks to Gabriel Bracha's authenticated double-echo broadcast protocol, which assumes an asynchronous fully connected network. Danny Dolev's algorithm can then be used to provide reliable communications between processes in the global fault model, where up to f processes among N can be faulty in a communication network that is at least 2f+1-connected. Following recent works that showed how Dolev's protocol can be made more practical thanks to several optimizations, we show that the state-of-the-art methods to solve our problem can be optimized thanks to layer-specific and cross-layer optimizations. Our simulations with the Omnet++ network simulator show that these optimizations can be efficiently combined to decrease the total amount of information transmitted or the protocol's latency (e.g., respectively, -25% and -50% with a 16B payload, N=31 and f=4) compared to the state-of-the-art combination of Bracha's and Dolev's protocols.

Files

2104.03673.pdf
(pdf | 0.581 Mb)
License info not available