Byzantine broadcast with fixed disjoint paths

Alexandre Maurer 1 Sébastien Tixeuil 1
1 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Type de document :
Article dans une revue
Journal of Parallel and Distributed Computing, Elsevier, 2014, 74 (11), pp.3153--3160. 〈10.1016/j.jpdc.2014.07.010〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01151757
Contributeur : Lip6 Publications <>
Soumis le : mercredi 13 mai 2015 - 15:27:49
Dernière modification le : vendredi 14 décembre 2018 - 01:27:34

Identifiants

Collections

Citation

Alexandre Maurer, Sébastien Tixeuil. Byzantine broadcast with fixed disjoint paths. Journal of Parallel and Distributed Computing, Elsevier, 2014, 74 (11), pp.3153--3160. 〈10.1016/j.jpdc.2014.07.010〉. 〈hal-01151757〉

Partager

Métriques

Consultations de la notice

83