Fault-tolerant consensus in directed graphs

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 2015-July, Issue , 2015, Pages 451-460

  Tseng, Lewis ^a   Vaidya, Nitin H ^a  

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

Author keywords

Asynchronous and synchronous systems; Consensus; Crash and byzantine faults; Directed networks

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANCE; GRAPHIC METHODS;

ASYNCHRONOUS SYSTEM; BYZANTINE CONSENSUS; BYZANTINE FAULT; COMMUNICATION GRAPHS; CONSENSUS; DIRECTED NETWORK; POINT-TO-POINT NETWORK; SYNCHRONOUS SYSTEM;

DIRECTED GRAPHS;

EID: 84957662809     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2767386.2767399     Document Type: Conference Paper

References (26)

1. I. Abraham, Y. Amit, and D. Dolev. Optimal resilience asynchronous approximate agreement. In OPODIS, pages 229-239, 2004.
2. E. Alchieri, A. Bessani, J. Silva Fraga, and F. Greve. Byzantine consensus with unknown participants. In T. Baker, A. Bui, and S. Tixeuil, editors, Principles of Distributed Systems, volume 5401 of Lecture Notes in Computer Science, pages 22-40. Springer Berlin Heidelberg, 2008.
3. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations, and Advanced Topics. Wiley Series on Parallel and Distributed Computing, 2004.
4. P. Bansal, P. Gopal, A. Gupta, K. Srinathan, and P. K. Vasishta. Byzantine agreement using partial authentication. In Proceedings of the 25th international conference on Distributed computing, DISC'11, pages 389-403, Berlin, Heidelberg, 2011. Springer-Verlag.
5. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Optimization and Neural Computation Series. Athena Scientific, 1997.
6. M. Biely, P. Robinson, and U. Schmid. Agreement in directed dynamic networks. In Structural Information and Communication Complexity, volume 7355 of Lecture Notes in Computer Science, pages 73-84. Springer Berlin Heidelberg, 2012.
7. M. Biely, P. Robinson, U. Schmid, M. Schwarz, and K. Winkler. Gracefully degrading consensus and k-set agreement in directed dynamic networks. CoRR, abs/1408.0620, 2014.
8. B. Charron-Bost, M. Fugger, and T. Nowak. Approximate consensus in highly dynamic networks. CoRR, abs/1408.0620, 2014.
9. D. Dolev. The Byzantine generals strike again. Journal of Algorithms, 3(1):14-30, March 1982.
10. 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.
11. M. J. Fischer, N. A. Lynch, and M. Merritt. Easy impossibility proofs for distributed consensus problems. In Proceedings of the fourth annual ACM symposium on Principles of distributed computing, PODC '85, pages 59-70, NY, USA, 1985. ACM.
12. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32:374-382, April 1985.
13. 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.
14. L. Lamport. The weak Byzantine generals problem. J. ACM, 30(3):668-676, July 1983.
15. H. LeBlanc, H. Zhang, X. Koutsoukos, and S. Sundaram. Resilient asymptotic consensus in robust networks. IEEE Journal on Selected Areas in Communications: Special Issue on In-Network Computation, 31:766-781, April 2013.
16. H. LeBlanc, H. Zhang, S. Sundaram, and X. Koutsoukos. Consensus of multi-agent networks in the presence of adversaries using only local information. HiCoNs, 2012.
17. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
18. A. Maurer, S. Tixeuil, and X. Defago. Reliable communication in a dynamic network in the presence of Byzantine faults. CoRR, abs/1402.0121, 2014.
19. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2):228-234, Apr. 1980.
20. L. Su and N. Vaidya. Reaching approximate Byzantine consensus with multi-hop communication. CoRR, abs/1411.5282, 2014.
21. L. Tseng and N. H. Vaidya. Exact Byzantine consensus in directed graphs. CoRR, abs/1208.5075, 2012.
22. L. Tseng and N. H. Vaidya. Crash-Tolerant Consensus in Directed Graphs. CoRR, abs/1412.8532, 2014.
23. L. Tseng and N. H. Vaidya. Iterative approximate Byzantine consensus under a generalized fault model. In International Conference on Distributed Computing and Networking (ICDCN), January 2013.
24. N. H. Vaidya, L. Tseng, and G. Liang. Iterative approximate Byzantine consensus in arbitrary directed graphs. In Proceedings of the thirtyrst annual ACM symposium on Principles of distributed computing, PODC '12. ACM, 2012.
25. H. Zhang and S. Sundaram. Robustness of complex networks with implications for consensus and contagion. In Proceedings of CDC 2012, the 51st IEEE Conference on Decision and Control, 2012.
26. H. Zhang and S. Sundaram. Robustness of distributed algorithms to locally bounded adversaries. In Proceedings of ACC 2012, the 31st American Control Conference, 2012.