{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T18:29:36Z","timestamp":1785522576186,"version":"3.56.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T00:00:00Z","timestamp":1748563200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Perform. Eval. Comput. Syst."],"published-print":{"date-parts":[[2025,9,30]]},"abstract":"<jats:p>Distributed ledgers are common in the industry. Some of them can use blockchains as their underlying infrastructure. A blockchain requires participants to agree on its contents. This can be achieved via a consensus protocol. How do these protocols differ in performance, and how are the differences affected by the communication network? Moreover, such a protocol would need a timer to ensure progress, but how should the timer be set?<\/jats:p>\n          <jats:p>This article presents an analytical model to address these and related issues when there are crash faults. Specifically, it focuses on two consensus protocols (Istanbul BFT and HotStuff) and two network topologies (Folded-Clos and Dragonfly). The model provides formulas that express the consensus time in terms of protocol and topology parameters. No other model in the literature provides such a global view of the parameter space.<\/jats:p>\n          <jats:p>Analysis of the closed-form expressions yield new insights into how the timers should be set, how faults affect the consensus time, when one protocol is faster than the other, and how the two topologies differ in their impact.<\/jats:p>\n          <jats:p>The formulas and analyses are validated with simulations. The conclusion also offers some tips for the analytical modeling of similar protocols.<\/jats:p>","DOI":"10.1145\/3724115","type":"journal-article","created":{"date-parts":[[2025,3,16]],"date-time":"2025-03-16T09:34:31Z","timestamp":1742117671000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A Performance Analysis of Consensus Time for Blockchains"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-0320-8322","authenticated-orcid":false,"given":"J.D.","family":"Chan","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6280-2469","authenticated-orcid":false,"given":"Y.C.","family":"Tay","sequence":"additional","affiliation":[{"name":"Computer Science, National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0820-9618","authenticated-orcid":false,"given":"Brian","family":"Yen","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,5,30]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.2200\/S00341ED1V01Y201103CAC014"},{"key":"e_1_3_3_3_2","first-page":"281","volume-title":"Proceedings of the 7th USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201910)","author":"Al-Fares Mohammad","year":"2010","unstructured":"Mohammad Al-Fares, Sivasankar Radhakrishnan, Barath Raghavan, Nelson Huang, and Amin Vahdat. 2010. Hedera: Dynamic flow scheduling for data center networks. In Proceedings of the 7th USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201910). 281\u2013296. http:\/\/www.usenix.org\/events\/nsdi10\/tech\/full_papers\/al-fares.pdf"},{"key":"e_1_3_3_4_2","first-page":"313","volume-title":"Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201924)","author":"Antunes Diogo S.","year":"2024","unstructured":"Diogo S. Antunes, Afonso N. Oliveira, Andr\u00e9 Breda, Matheus Guilherme Franco, Henrique Moniz, and Rodrigo Rodrigues. 2024. Alea-BFT: Practical asynchronous Byzantine fault tolerance. In Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201924). 313\u2013328. https:\/\/www.usenix.org\/conference\/nsdi24\/presentation\/antunes"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/2658994"},{"key":"e_1_3_3_6_2","first-page":"355","volume-title":"Proceedings of the 44th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN\u201914)","author":"Bessani Alysson Neves","year":"2014","unstructured":"Alysson Neves Bessani, Jo\u00e3o Sousa, and Eduardo Ad\u00edlio Pelinson Alchieri. 2014. State machine replication for the masses with BFT-SMART. In Proceedings of the 44th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN\u201914). IEEE, 355\u2013362. 10.1109\/DSN.2014.43"},{"key":"e_1_3_3_7_2","first-page":"348","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis (SC\u201914)","author":"Besta Maciej","year":"2014","unstructured":"Maciej Besta and Torsten Hoefler. 2014. Slim Fly: A cost effective low-diameter network topology. In Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis (SC\u201914). IEEE, 348\u2013359. 10.1109\/SC.2014.34"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","unstructured":"Harold Carr Christa Jenkins Mark Moir Victor Cacciari Miraldo and Lisandra Silva. 2022. Towards formal verification of Hotstuff-based Byzantine fault tolerant consensus in Agda. In NASA Formal Methods. Lecture Notes in Computer Science Vol. 13260. Springer 616\u2013635. 10.1007\/978-3-031-06773-0_33","DOI":"10.1007\/978-3-031-06773-0_33"},{"key":"e_1_3_3_9_2","first-page":"173","volume-title":"Proceedings of the 3rd USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201999)","author":"Castro Miguel","year":"1999","unstructured":"Miguel Castro and Barbara Liskov. 1999. Practical Byzantine fault tolerance. In Proceedings of the 3rd USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201999). 173\u2013186. https:\/\/dl.acm.org\/citation.cfm?id=296824"},{"key":"e_1_3_3_10_2","first-page":"153","volume-title":"Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201909)","author":"Clement Allen","year":"2009","unstructured":"Allen Clement, Edmund L. Wong, Lorenzo Alvisi, Michael Dahlin, and Mirco Marchetti. 2009. Making Byzantine fault tolerant systems tolerate Byzantine faults. In Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201909). 153\u2013168. http:\/\/www.usenix.org\/events\/nsdi09\/tech\/full_papers\/clement\/clement.pdf"},{"key":"e_1_3_3_11_2","first-page":"34","volume-title":"Proceedings of the 17th European Conference on Computer Systems (EuroSys\u201922)","author":"Danezis George","year":"2022","unstructured":"George Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, and Alexander Spiegelman. 2022. Narwhal and Tusk: A DAG-based mempool and efficient BFT consensus. In Proceedings of the 17th European Conference on Computer Systems (EuroSys\u201922). ACM, New York, NY, USA, 34\u201350. 10.1145\/3492321.3519594"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3006078"},{"key":"e_1_3_3_14_2","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1145\/3485730.3493374","volume-title":"Proceedings of the 19th ACM Conference on Embedded Networked Sensor Systems (SenSys\u201921)","author":"Gerrits Luc","year":"2021","unstructured":"Luc Gerrits, Cyril Naves Samuel, Roland Kromes, Fran\u00e7ois Verdier, Severine Glock, and Patricia Guitton-Ouhamou. 2021. Experimental scalability study of consortium blockchains with BFT consensus for IoT automotive use case. In Proceedings of the 19th ACM Conference on Embedded Networked Sensor Systems (SenSys\u201921). ACM, New York, NY, USA, 492\u2013498. 10.1145\/3485730.3493374"},{"key":"e_1_3_3_15_2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/3132747.3132757","volume-title":"Proceedings of the 26th Symposium on Operating Systems Principles","author":"Gilad Yossi","year":"2017","unstructured":"Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vlachos, and Nickolai Zeldovich. 2017. Algorand: Scaling Byzantine agreements for cryptocurrencies. In Proceedings of the 26th Symposium on Operating Systems Principles. ACM, New York, NY, USA, 51\u201368. 10.1145\/3132747.3132757"},{"key":"e_1_3_3_16_2","first-page":"1392","volume-title":"Proceedings of the 37th IEEE International Conference on Data Engineering (ICDE\u201921)","author":"Gupta Suyash","year":"2021","unstructured":"Suyash Gupta, Jelle Hellings, and Mohammad Sadoghi. 2021. RCC: Resilient concurrent consensus for high-throughput secure transaction processing. In Proceedings of the 37th IEEE International Conference on Data Engineering (ICDE\u201921). IEEE, 1392\u20131403. 10.1109\/ICDE51399.2021.00124"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2023.3308848"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3401591"},{"key":"e_1_3_3_19_2","unstructured":"L. Kleinrock. 1974. Queueing Systems. Vol. I. Wiley. 74009846"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/1658357.1658358"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.3233\/MGS-230074"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-022-01380-x"},{"key":"e_1_3_3_24_2","first-page":"1","volume-title":"Proceedings of the IEEE Power and Energy Society Innovative Smart Grid Technologies Conference (ISGT\u201921)","author":"Machacek Travis","year":"2021","unstructured":"Travis Machacek, Milan Biswal, and Satyajayant Misra. 2021. Proof of X: Experimental insights on blockchain consensus algorithms in energy markets. In Proceedings of the IEEE Power and Energy Society Innovative Smart Grid Technologies Conference (ISGT\u201921). IEEE, 1\u20135. 10.1109\/ISGT49243.2021.9372194"},{"key":"e_1_3_3_25_2","first-page":"New York, NY, A","volume-title":"Proceedings of the 5th Workshop on Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating Algorithms for Distributed Systems (ApPLIED\u201923)","author":"Malkhi Dahlia","year":"2023","unstructured":"Dahlia Malkhi and Maofan Yin. 2023. Invited paper: Lessons from HotStuff. In Proceedings of the 5th Workshop on Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating Algorithms for Distributed Systems (ApPLIED\u201923). ACM, New York, NY, Article 3, 8 pages. 10.1145\/3584684.3597268"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3049915"},{"key":"e_1_3_3_27_2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/2976749.2978399","volume-title":"Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security","author":"Miller Andrew","year":"2016","unstructured":"Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi, and Dawn Song. 2016. The honey badger of BFT protocols. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. ACM, New York, NY, USA, 31\u201342. 10.1145\/2976749.2978399"},{"key":"e_1_3_3_28_2","article-title":"The Istanbul BFT consensus algorithm","volume":"2002","author":"Moniz Henrique","year":"2020","unstructured":"Henrique Moniz. 2020. The Istanbul BFT consensus algorithm. CoRR abs\/2002.03613 (2020). https:\/\/arxiv.org\/abs\/2002.03613","journal-title":"CoRR"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2007.912191"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3194889"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3308897.3308952"},{"key":"e_1_3_3_33_2","first-page":"Article 16, 32","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis (SC\u201919)","author":"Sensi Daniele De","year":"2019","unstructured":"Daniele De Sensi, Salvatore Di Girolamo, and Torsten Hoefler. 2019. Mitigating network noise on Dragonfly networks through application-aware routing. In Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis (SC\u201919). ACM. New York, NY, Article 16, 32 pages. 10.1145\/3295500.3356196"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","unstructured":"F\u00e1bio Silva Ana Nunes Alonso Jos\u00e9 Pereira and Rui Oliveira. 2020. A comparison of message exchange patterns in BFT protocols (experience report). In Distributed Applications and Interoperable Systems. Lecture Notes in Computer Science Vol. 12135. Springer 104\u2013120. 10.1007\/978-3-030-50323-9_7","DOI":"10.1007\/978-3-030-50323-9_7"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.5070\/sr32159278"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.2200\/S00859ED3V01Y201806CSL010"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/1498765.1498785"},{"key":"e_1_3_3_38_2","first-page":"15","volume-title":"Proceedings of the 2nd ACM SIGCOMM Workshop on Future of Internet Routing and Addressing (FIRA@SIGCOMM\u201923)","author":"Willis Peter","year":"2023","unstructured":"Peter Willis, Miaoxin Li, and Nirmala Shenoy. 2023. Performance of meshed tree protocol in data center networks. In Proceedings of the 2nd ACM SIGCOMM Workshop on Future of Internet Routing and Addressing (FIRA@SIGCOMM\u201923). ACM, New York, NY, USA, 15\u201322. 10.1145\/3607504.3609290"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3579845"},{"key":"e_1_3_3_40_2","first-page":"347","volume-title":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC\u201919)","author":"Yin Maofan","year":"2019","unstructured":"Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan-Gueta, and Ittai Abraham. 2019. HotStuff: BFT consensus with linearity and responsiveness. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC\u201919). ACM, New York, NY, USA, 347\u2013356. 10.1145\/3293611.3331591"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/J.COMCOM.2020.01.073"},{"key":"e_1_3_3_42_2","first-page":"633","volume-title":"Proceedings of the 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201920)","author":"Zhang Yunhao","year":"2020","unstructured":"Yunhao Zhang, Srinath T. V. Setty, Qi Chen, Lidong Zhou, and Lorenzo Alvisi. 2020. Byzantine ordered consensus without Byzantine oligarchy. In Proceedings of the 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201920). 633\u2013649. https:\/\/www.usenix.org\/conference\/osdi20\/presentation\/zhang-yunhao"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","unstructured":"Rong Wang Minfu Yuan Zhenyu Wang and Yin Li. 2024. Improved fast-response consensus algorithm based on HotStuff. Sensors 24 16 (2024) 5417. DOI:10.3390\/S24165417","DOI":"10.3390\/S24165417"}],"container-title":["ACM Transactions on Modeling and Performance Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3724115","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3724115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:59Z","timestamp":1750295939000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3724115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,30]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9,30]]}},"alternative-id":["10.1145\/3724115"],"URL":"https:\/\/doi.org\/10.1145\/3724115","relation":{},"ISSN":["2376-3639","2376-3647"],"issn-type":[{"value":"2376-3639","type":"print"},{"value":"2376-3647","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,30]]},"assertion":[{"value":"2024-05-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-07","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-05-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}