Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures

Abstract : Ensuring reliable communication despite possibly malicious participants is a primary objective in any distributed system or network. In this paper, we investigate the possibility of reliable broadcast in a dynamic network whose topology may evolve while the broadcast is in progress. In particular, we adapt the Certified Propagation Algorithm (CPA) to make it work on dynamic networks and we present conditions (on the underlying dynamic graph) to enable safety and liveness properties of the reliable broadcast. We furthermore explore the complexity of assessing these conditions for various classes of dynamic networks.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-02076398
Contributor : Giovanni Farina <>
Submitted on : Friday, March 22, 2019 - 10:09:13 AM
Last modification on : Wednesday, March 27, 2019 - 1:36:07 AM

Identifiers

Citation

Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil. Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures. SSS 2018 - 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Nov 2018, Tokyo, Japan. Springer, 11201, pp.170-185, Lecture Notes in Computer Science. 〈10.1007/978-3-030-03232-6_12〉. 〈hal-02076398〉

Share

Metrics

Record views

12