Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs

Details Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs

2012-01-19

arxiv.org/abs/1201.4183v2

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-320048