Document Open Access Logo

Bounds on Worst-Case Responsiveness for Agreement Algorithms

Authors Hagit Attiya , Jennifer L. Welch

PDF
Thumbnail PDF

File

LIPIcs.OPODIS.2023.32.pdf
  • Filesize: 0.75 MB
  • 22 pages

Document Identifiers

Author Details

Hagit Attiya
  • Department of Computer Science, Technion, Haifa, Israel
Jennifer L. Welch
  • Department of Computer Science and Engineering, Texas A&M University, College Station, TX, USA

Funding

  • Attiya, Hagit: partially supported by the Israel Science Foundation (grant 22/1425).

Cite AsGet BibTex

Hagit Attiya and Jennifer L. Welch. Bounds on Worst-Case Responsiveness for Agreement Algorithms. In 27th International Conference on Principles of Distributed Systems (OPODIS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 286, pp. 32:1-32:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.OPODIS.2023.32

Abstract

We study the worst-case time complexity of solving two agreement problems, consensus and broadcast, in systems with n processes subject to no more than t process failures. In both problems, correct processes must decide on a common value; in the consensus problem, each process has an input and if the inputs of correct processes are all the same, then that must be the common decision, whereas in the broadcast problem, only one process (the sender) has an input and if the sender is correct, then its input must be the common decision. We focus on systems where there is an upper bound Δ on the message delivery time but it is expected that typically, messages arrive much faster, say within some time d. While Δ may or may not be known in advance, d is inherently unknown and specific to each execution. The goal is to design deterministic algorithms whose running times have minimal to no dependence on Δ, a property called responsiveness. We present a generic algorithm transformation that, when applied to appropriate eventually-synchronous consensus (or broadcast) algorithms, results in consensus (or broadcast) algorithms for send omission failures, authenticated Byzantine failures, and unauthenticated Byzantine failures whose running times have no dependence on Δ; their worst-case time complexities are all O(td), which is asymptotically optimal. The algorithm for send omission failures requires n > 2t, while those for Byzantine failures, both authenticated and unauthenticated, require n > 3t. The failure-resilience of the unauthenticated Byzantine algorithm is optimal. For authenticated Byzantine failures, existing agreement algorithms provide worst-case time complexity O(t Δ) when n is at most 3t. (When n ≤ 2t, broadcast is solvable while consensus is not.) We prove a lower bound on the worst-case time complexity of ⌊(3t-n)/2⌋ d + Δ when n is at most 3t. Although lower bounds of Δ and (t+1)d were already known, our new lower bound indicates that, at least when n ≤ 2t, it is impossible for an algorithm to pay these bounds in parallel.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
Keywords
  • bounded-delay model
  • basic round model
  • omission failures
  • Byzantine failures

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Ittai Abraham. State machine replication for two servers and one omission failure is impossible even in a lock-step model. https://decentralizedthoughts.github.io/2019-11-02-primary-backup-for-2-servers-and-omission-failures-is-impossible/, 2019.
  2. Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Maofan Yin. Sync hotstuff: Simple and practical synchronous state machine replication. In IEEE Symposium on Security and Privacy (SP), pages 106-118. IEEE, 2020. URL: https://doi.org/10.1109/SP40000.2020.00044.
  3. Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. Brief announcement: Byzantine agreement, broadcast and state machine replication with optimal good-case latency. In 34th International Symposium on Distributed Computing (DISC), 2020. URL: https://arxiv.org/abs/2003.13155.
  4. Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. Good-case latency of Byzantine broadcast: A complete categorization. In 2021 ACM Symposium on Principles of Distributed Computing (PODC), pages 331-341, 2021. URL: https://doi.org/10.1145/3465084.3467899.
  5. Hagit Attiya, Fatemeh Borran, Martin Hutle, Zarko Milosevic, and André Schiper. Structured derivation of semi-synchronous algorithms. In International Symposium on Distributed Computing (DISC), pages 374-388. Springer, 2011. URL: https://doi.org/10.1007/978-3-642-24100-0_37.
  6. Hagit Attiya, Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Bounds on the time to reach agreement in the presence of timing uncertainty. J. ACM, 41(1):122-152, 1994. URL: https://doi.org/10.1145/174644.174649.
  7. Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, and Larry J. Stockmeyer. Bounds on the time to reach agreement in the presence of timing uncertainty. In Cris Koutsougeras and Jeffrey Scott Vitter, editors, Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5-8, 1991, New Orleans, Louisiana, USA, pages 359-369. ACM, 1991. URL: https://doi.org/10.1145/103418.103457.
  8. Hagit Attiya and Jennifer Welch. Distributed computing: fundamentals, simulations, and advanced topics. McGraw-Hill Publishing Company, 1st edition, 1998. Google Scholar
  9. A.A. Bharali and P. Berman. Distributed consensus with general omission failures and timing uncertainty. In Proceedings of Phoenix Conference on Computers and Communications, pages 168-174, 1993. URL: https://doi.org/10.1109/PCCC.1993.344468.
  10. Miguel Castro and Barbara Liskov. Practical Byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems, 20(4):398-461, 2002. URL: https://doi.org/10.1145/571637.571640.
  11. Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic, and Manuel Vidigueira. Byzantine consensus is Θ(n²): The Dolev-Reischuk bound is tight even in partial synchrony! In Christian Scheideler, editor, 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA, volume 246 of LIPIcs, pages 14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPIcs.DISC.2022.14.
  12. Danny Dolev and H. Raymond Strong. Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing, 12(4):656-666, 1983. URL: https://doi.org/10.1137/0212045.
  13. Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony. J. ACM, 35(2):288-323, 1988. URL: https://doi.org/10.1145/42282.42283.
  14. Cynthia Dwork and Larry Stockmeyer. Bounds on the time to reach agreement as a function of message delay. Technical Report RJ 8181 (75140), IBM Thomas J. Watson Research Division, jun 1991. available in URL: https://drive.google.com/file/d/1zoCe05kzhOWBRi2DQ7OmFpZJxBPMpzSS/view?usp=sharing.
  15. Michael J Fischer, Nancy A Lynch, and Michael Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Computing, 1(1):26-39, 1986. URL: https://doi.org/10.1007/BF01843568.
  16. Michael J Fischer, Nancy A Lynch, and Michael S Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374-382, 1985. URL: https://doi.org/10.1145/3149.214121.
  17. Juan A Garay, Jonathan Katz, Chiu-Yuen Koo, and Rafail Ostrovsky. Round complexity of authenticated broadcast with a dishonest majority. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 658-668, 2007. URL: https://doi.org/10.1109/FOCS.2007.61.
  18. Amir Herzberg and Shay Kutten. Fast isolation of arbitrary forwarding faults. In Piotr Rudnicki, editor, Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, Edmonton, Alberta, Canada, August 14-16, 1989, pages 339-353. ACM, 1989. URL: https://doi.org/10.1145/72981.73006.
  19. Amir Herzberg and Shay Kutten. Early detection of message forwarding faults. SIAM Journal on Computing, 30(4):1169-1196, 2000. URL: https://doi.org/10.1137/S0097539796312745.
  20. Michael Merritt. Notes on the Dolev-Strong lower bound for Byzantine Agreement. unpublished manuscript, 1985. Google Scholar
  21. Dimitris Michailidis. Fast set agreement in the presence of timing uncertainty. In Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, PODC, '99Atlanta, Georgia, USA, May 3-6, 1999, pages 249-256. ACM, 1999. URL: https://doi.org/10.1145/301308.301365.
  22. Atsuki Momose, Jason Paul Cruz, and Yuichi Kaji. Hybrid-BFT: Optimistically responsive synchronous consensus with optimal latency or resilience. Cryptology ePrint Archive, Paper 2020/406, 2020. URL: https://eprint.iacr.org/2020/406.
  23. Rafael Pass and Elaine Shi. Hybrid consensus: Efficient consensus in the permissionless model. In 31 International Symposium on Distributed Computing (DISC), 2017. URL: https://doi.org/10.4230/LIPICS.DISC.2017.39.
  24. Rafael Pass and Elaine Shi. Thunderella: Blockchains with optimistic instant confirmation. In Advances in Cryptology (EUROCRYPT): 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 3-33. Springer, 2018. URL: https://doi.org/10.1007/978-3-319-78375-8_1.
  25. Marshall Pease, Robert Shostak, and Leslie Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2):228-234, 1980. URL: https://doi.org/10.1145/322186.322188.
  26. Stephen Ponzio. The real-time cost of timing uncertainty: Consensus and failure detection. Master’s thesis, MIT, 1991. Google Scholar
  27. Nibesh Shrestha, Ittai Abraham, Ling Ren, and Kartik Nayak. On the optimality of optimistic responsiveness. In ACM SIGSAC Conference on Computer and Communications Security (CCS), pages 839-857, 2020. URL: https://doi.org/10.1145/3372297.3417284.
  28. TK Srikanth and Sam Toueg. Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distributed Computing, 2:80-94, 1987. URL: https://doi.org/10.1007/BF01667080.
  29. Jun Wan, Hanshen Xiao, Elaine Shi, and Srinivas Devadas. Expected constant round Byzantine broadcast under dishonest majority. In 18th International Conference on Theory of Cryptography (TCC), pages 381-411, 2020. URL: https://doi.org/10.1007/978-3-030-64375-1_14.
  30. Maofan Yin, Dahlia Malkhi, Michael K Reiter, Guy Golan Gueta, and Ittai Abraham. Hotstuff: BFT consensus with linearity and responsiveness. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pages 347-356, 2019. URL: https://doi.org/10.1145/3293611.3331591.
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact