Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs
Nitin Vaidya, Lewis Tseng, Guanfeng Liang
TL;DR
This paper establishes a fundamental condition for the existence of iterative approximate Byzantine consensus algorithms in arbitrary directed graphs, advancing understanding of fault-tolerant distributed systems.
Contribution
It provides a necessary and sufficient condition for iterative Byzantine consensus in arbitrary directed graphs, a significant theoretical advancement.
Findings
Derived a necessary and sufficient condition for consensus algorithms
Analyzed specific graphs to determine the existence of algorithms
Enhanced theoretical understanding of Byzantine fault tolerance
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Optimization and Search Problems · Cooperative Communication and Network Coding