Back to Search
Start Over
Byzantine broadcast with fixed disjoint paths.
- Source :
-
Journal of Parallel & Distributed Computing . Nov2014, Vol. 74 Issue 11, p3153-3160. 8p. - Publication Year :
- 2014
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 07437315
- Volume :
- 74
- Issue :
- 11
- Database :
- Academic Search Index
- Journal :
- Journal of Parallel & Distributed Computing
- Publication Type :
- Academic Journal
- Accession number :
- 98482838
- Full Text :
- https://doi.org/10.1016/j.jpdc.2014.07.010