Iterative approximate byzantine consensus in arbitrary directed graphs

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2012, Pages 365-374

  Vaidya, Nitin H ^a   Tseng, Lewis ^b   Liang, Guanfeng ^a  

^a University of Illinois at Urbana Champaign   (United States)

^b Computer Science Department ^*  (United States)

Author keywords

byzantine faults; consensus; iterative algorithms

Indexed keywords

ARBITRARY DIRECTED GRAPHS; ASYNCHRONOUS SYSTEM; BYZANTINE CONSENSUS; BYZANTINE FAULT; CONSENSUS; CONSENSUS ALGORITHMS; CONVEX HULL; FAULT-FREE NODES; ITERATIVE ALGORITHM; NUMBER OF ITERATIONS; POINT-TO-POINT NETWORK; SUFFICIENT CONDITIONS;

ALGORITHMS; DIRECTED GRAPHS; DISTRIBUTED COMPUTER SYSTEMS;

ITERATIVE METHODS;

EID: 84864978466     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2332432.2332505     Document Type: Conference Paper

References (19)

1. A. Azadmanesh and H. Bajwa. Global convergence in partially fully connected networks (PFCN) with limited relays. Conf. of IEEE Industrial Electronics Soc. (IECON), 2001.
2. M. H. Azadmanesh and R. Kieckhafer. Asynchronous approximate agreement in partially connected networks. International Journal of Parallel and Distributed Systems and Networks, 2002. http://ahvaz.unomaha.edu/azad/pubs/ijpdsn. asyncpart.pdf
3. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Optimization and Neural Computation Series. Athena Scientific, 1997.
4. S. Dasgupta, C. Papadimitriou, and U. Vazirani. Algorithms. McGraw-Hill Higher Education, 2006.
5. D. Dolev, N. A. Lynch, S. S. Pinter, E. W. Stark, and W. E.Weihl. Reaching approximate agreement in the presence of faults. J. ACM, 33:499-516, May 1986.
6. A. D. Fekete. Asymptotically optimal algorithms for approximate agreement. ACM PODC, 1986.
7. M. J. Fischer, N. A. Lynch, andM. Merritt. Easy impossibility proofs for distributed consensus problems. ACM PODC, 1985.
8. M. J. Fischer, N. A. Lynch, andM. S. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32:374-382, April 1985.
9. A. Jadbabaie, J. Lin, and A. Morse. Coordination of groups of mobile autonomous agents using nearest neighbor rules. Automatic Control, IEEE Transactions on, 48(6):988-1001, June 2003.
10. R. M. Kieckhafer and M. H. Azadmanesh. Low cost approximate agreement in partially connected networks. J. of Computing and Information, 1993. http:// ahvaz.ist.unomaha.edu/azad/pubs/jci.syncpart.pdf
11. H. LeBlanc and X. Koutsoukos. Consensus in networked multi-agent systems with adversaries. 14th International conference on Hybrid Systems: Computation and Control (HSCC), 2011.
12. H. LeBlanc and X. Koutsoukos. Low complexity resilient consensus in networked multi-agent systems with adversaries. Int. Conf. on Hybrid Systems: Computation and Control (HSCC), 2012.
13. H. LeBlanc, H. Zhang, S. Sundaram, and X. Koutsoukos. Consensus of multi-agent networks in the presence of adversaries using only local information. Conference on High Confidence Networked Systems (HiCoNS), 2012.
14. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
15. L. Tseng and N. H. Vaidya, "Iterative Approximate Byzantine Consensus under a Generalized Fault Model," report under preparation, May 2012.
16. N. H. Vaidya, L. Tseng, and G. Liang. Iterative approximate Byzantine consensus in arbitrary directed graphs. Tech. Rep., University of Illinois, January 2012. http://arxiv.org/abs/1201.4183
17. N. H. Vaidya, L. Tseng, and G. Liang. Iterative approximate Byzantine consensus in arbitrary directed graphs - Part II: Synchronous and asynchronous systems. Tech. Rep., University of Illinois, February 2012. http://arxiv.org/ abs/1202.6094
18. N. H. Vaidya, "Matrix Representation of Iterative Approximate Byzantine Consensus in Directed Graphs," Tech. Rep., University of Illinois, March 2012. http://arxiv.org/abs/1203.1888
19. H. Zhang and S. Sundaram. Robustness of information diffusion algorithms to locally bounded adversaries. http://arxiv.org/abs/1110.3843, October 2011. A version to appear at ACC 2012 as Robustness of Distributed Algorithms to Locally Bounded Adversaries.