Approximate byzantine consensus in faulty asynchronous networks

In this paper, a novel fault-tolerant algorithm for achieving approximate Byzantine consensus in asynchronous networks is proposed. It is shown that the topological condition required for the success of the algorithm is more relaxed than the previous results. We prove that the synchronicity of the network does not affect this condition and the algorithm succeeds in synchronous networks as well. The same fact is concluded in networks with delay on communication paths. Finally, we extend the results to networks with time-varying underlying graph.

[1]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[2]  Lewis Tseng,et al.  Iterative approximate byzantine consensus in arbitrary directed graphs , 2012, PODC '12.

[3]  Xenofon Koutsoukos,et al.  Consensus in networked multi-agent systems with adversaries , 2011 .

[4]  R. Kieckhafer,et al.  Low Cost Approximate Agreement In Partially Connected Networks , 1993 .

[5]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[6]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[7]  Nitin H. Vaidya,et al.  Matrix Representation of Iterative Approximate Byzantine Consensus in Directed Graphs , 2012, ArXiv.

[8]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.

[9]  Saminathan Ponnusamy.  Foundations of Mathematical Analysis , 2011 .

[10]  Nancy A. Lynch,et al.  Reaching approximate agreement in the presence of faults , 1986, JACM.

[11]  Shreyas Sundaram,et al.  Resilient Asymptotic Consensus in Robust Networks , 2013, IEEE Journal on Selected Areas in Communications.

[12]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[13]  Roger M. Kieckhafer,et al.  Reaching Approximate Agreement with Mixed-Mode Faults , 1994, IEEE Trans. Parallel Distributed Syst..

[14]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[15]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.