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.
Type de document :
Rapport
[Technical Report] Sorbonne Université, CNRS, Laboratoire d’Informatique de Paris 6, LIP6, F-75005 Paris, France; Dipartimento di Ingegneria Informatica Automatica e Gestionale "Antonio Ruberti", Università degli Studi di Roma La Sapienza, Rome, Italy. 2018
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01712277
Contributeur : Giovanni Farina <>
Soumis le : mercredi 31 octobre 2018 - 11:30:42
Dernière modification le : vendredi 16 novembre 2018 - 02:20:35

Fichiers

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01712277, version 3
  • ARXIV : 1811.01770

Collections

Citation

Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil. Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures. [Technical Report] Sorbonne Université, CNRS, Laboratoire d’Informatique de Paris 6, LIP6, F-75005 Paris, France; Dipartimento di Ingegneria Informatica Automatica e Gestionale "Antonio Ruberti", Università degli Studi di Roma La Sapienza, Rome, Italy. 2018. 〈hal-01712277v3〉

Partager

Métriques

Consultations de la notice

32

Téléchargements de fichiers

32