Byzantine broadcast with fixed disjoint paths - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Parallel and Distributed Computing Année : 2014

Byzantine broadcast with fixed disjoint paths

Alexandre Maurer
  • Fonction : Auteur
  • PersonId : 918732
Sébastien Tixeuil

Résumé

We consider the problem of reliably broadcasting a message in a multihop network. We assume that some nodes may be Byzantine, and behave arbitrarily. We focus on cryptography-free solutions. We propose a protocol for sparse networks (such as grids or tori) where the nodes are not aware of their position. Our protocol uses a fixed number of disjoint paths to accept and forward the message to be broadcast. It can be tuned to significantly improve the number of Byzantine nodes tolerated. We present both theoretical analysis and experimental evaluation.
Fichier non déposé

Dates et versions

hal-01151757 , version 1 (13-05-2015)

Identifiants

Citer

Alexandre Maurer, Sébastien Tixeuil. Byzantine broadcast with fixed disjoint paths. Journal of Parallel and Distributed Computing, 2014, 74 (11), pp.3153--3160. ⟨10.1016/j.jpdc.2014.07.010⟩. ⟨hal-01151757⟩
74 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More