Advertisement

Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract)

  • Ashish ChoudhuryEmail author
  • Gayathri Garimella
  • Arpita Patra
  • Divya Ravi
  • Pratik Sarkar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11085)

Abstract

Fault-tolerant distributed consensus is a fundamental problem in secure distributed computing. In this work, we consider the problem of distributed consensus in directed graphs tolerating crash failures. Tseng and Vaidya (PODC’15) presented necessary and sufficient condition for the existence of consensus protocols in directed graphs. We improve the round and communication complexity of their protocol. Moreover, we prove that our protocol requires the optimal number of communication rounds, required by any protocol belonging to a restricted class of crash-tolerant consensus protocols in directed graphs.

Keywords

Directed graph Consensus Crash failure Round complexity 

Notes

Acknowledgments

We thank the anonymous referees of SIROCCO 2018 for their helpful comments. The work of the first two authors is financially supported by Infosys foundation. The third author would like to acknowledge the financial support by SERB Women Excellence Award from Science and Engineering Research Board of India and INSPIRE Faculty Fellowship from Department of Science & Technology, India

References

  1. 1.
    Alchieri, E.A.P., Bessani, A.N., da Silva Fraga, J., Greve, F.: Byzantine consensus with unknown participants. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 22–40. Springer, Heidelberg (2008).  https://doi.org/10.1007/978-3-540-92221-6_4CrossRefGoogle Scholar
  2. 2.
    Attiya, H., Welch, J.: Distributed Computing: Fundamentals. Simulation and Advanced Topics, Wiley series on Parallel and Distributed Computing (2004)Google Scholar
  3. 3.
    Bansal, P., Gopal, P., Gupta, A., Srinathan, K., Vasishta, P.K.: Byzantine agreement using partial authentication. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 389–403. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-24100-0_38CrossRefGoogle Scholar
  4. 4.
    Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Athena Scientific, Optimization and Neural Computation Series (1997)Google Scholar
  5. 5.
    Charron-Bost, B., Függer, M., Nowak, T.: Approximate consensus in highly dynamic networks: the role of averaging algorithms. In: Halldórsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 528–539. Springer, Heidelberg (2015).  https://doi.org/10.1007/978-3-662-47666-6_42CrossRefGoogle Scholar
  6. 6.
    Choudhury, A., Garimella, G., Patra, A., Ravi, D., Sarkar, P.: Crash-tolerant consensus in directed graph revisited. Cryptology ePrint Archive, Report 2018/436 (2018)Google Scholar
  7. 7.
    Dolev, D.: The Byzantine generals strike again. J. Algorithms 3(1), 14–30 (1982)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Fischer, M.J., Lynch, N.A., Merritt, M.: Easy impossibility proofs for distributed consensus problems. In: PODC, pp. 59–70. ACM (1985)Google Scholar
  9. 9.
    Fitzi, M.: Generalized communication and security models in byzantine agreement. Ph.D. thesis, ETH Zurich (2002)Google Scholar
  10. 10.
    Jadbabaie, A., Lin, J., Morse, A.S.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans. Automat. Contr. 48(6), 988–1001 (2003)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann (1996)Google Scholar
  12. 12.
    Pease, M., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. JACM 27(2), 228–234 (1980)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Schmid, U., Weiss, B., Keidar, I.: Impossibility results and lower bounds for consensus under link failures. SIAM J. Comput. 38(5), 1912–1951 (2009)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Tseng, L.: Recent results on fault-tolerant consensus in message-passing networks. In: Suomela, J. (ed.) SIROCCO 2016. LNCS, vol. 9988, pp. 92–108. Springer, Cham (2016).  https://doi.org/10.1007/978-3-319-48314-6_7CrossRefGoogle Scholar
  15. 15.
    Tseng, L., Vaidya, N.H.: Crash-tolerant consensus in directed graphs. CoRR, abs/1412.8532, 2014. Conference version appeared as [16]Google Scholar
  16. 16.
    Tseng, L., Vaidya, N.H.: Fault-tolerant consensus in directed graphs. In: PODC, pp. 451–460. ACM (2015)Google Scholar
  17. 17.
    Tseng, L., Vaidya, N.H.: A note on fault-tolerant consensus in directed networks. SIGACT News 47(3), 70–91 (2016)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Ashish Choudhury
    • 1
    Email author
  • Gayathri Garimella
    • 3
  • Arpita Patra
    • 2
  • Divya Ravi
    • 2
  • Pratik Sarkar
    • 4
  1. 1.International Institute of Information Technology BangaloreBengaluruIndia
  2. 2.Department of Computer Science and AutomationIndian Institute of ScienceBengaluruIndia
  3. 3.Oregon State UniversityCorvallisUSA
  4. 4.Boston UniversityBostonUSA

Personalised recommendations