Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs
Abstract
In this paper, we explore the problem of iterative approximate Byzantine consensus in arbitrary directed graphs. In particular, we prove a necessary and sufficient condition for the existence of iterative byzantine consensus algorithms. Additionally, we use our sufficient condition to examine whether such algorithms exist for some specific graphs.
- Publication:
-
arXiv e-prints
- Pub Date:
- January 2012
- DOI:
- 10.48550/arXiv.1201.4183
- arXiv:
- arXiv:1201.4183
- Bibcode:
- 2012arXiv1201.4183V
- Keywords:
-
- Computer Science - Distributed;
- Parallel;
- and Cluster Computing