Abstract: Raft is a foundational consensus protocol for distributed systems, architected to ensure state machine replication and data consistency across machine clusters. However, traditional Raft faces significant performance bottlenecks, particularly regarding suboptimal election efficiency and substantial consensus latency in large-scale deployments. To address these challenges, this study presents MH-Raft, an enhanced consensus variant designed for high efficiency and minimal latency. We propose a hierarchical node management and election framework to optimize network coordination. Specifically, a leader election methodology leveraging the multi-objective evolutionary algorithm based on decomposition (MOEA/D) is formulated to minimize election latency by evaluating multi-dimensional node attributes. To further refine the proposed hierarchical architecture, a rigorous tightness definition is devised for optimal mediator node selection, which is integrated into a hybrid clustering algorithm that adaptively partitions the network and optimizes the mapping between mediator nodes and follower nodes. Quantitative evaluations via comprehensive experiments demonstrate that MH-Raft significantly reduces overall election latency and lowers consensus latency by 14.87%–34.45%, while enhancing average throughput by 30.43% compared to the conventional Raft implementation.

MH-Raft：一种基于MOEA/D和混合层次聚类的分布式系统高效低延迟共识算法

[1]Abbasihafshejani M, Manshaei MH, Jadliwala M, 2023. Detecting and punishing selfish behavior during gossiping in Algorand blockchain. IEEE Virtual Conf on Communications, p.49-55.

[2]Attaran M, 2022. Blockchain technology in healthcare: challenges and opportunities. Int J Healthc Manag, 15(1):70-83.

[3]Bagaria V, Kannan S, Tse D, et al., 2019. Prism: deconstructing the blockchain to approach physical limits. Proc ACM SIGSAC Conf on Computer and Communications Security, p.585-602.

[4]Ben Othmen R, Abbessi W, Ouni S, et al., 2023. Simulation of optimized cluster based PBFT blockchain validation process. IEEE Symp on Computers and Communications, p.1317-1322.

[5]Bentov I, Lee C, Mizrahi A, et al., 2014. Proof of activity: extending Bitcoin’s proof of work via proof of stake. ACM SIGMETRICS Perform Eval Rev, 42(3):34-37.

[6]Castro M, Liskov B, 1999. Practical Byzantine fault tolerance. Proc 3^rd Symp on Operating Systems Design and Implementation, p.173-186. https://dl.acm.org/doi/10.5555/296806.296824

[7]Chatterjee D, Banerjee P, Mazumdar S, 2023. Chrisimos: a useful proof-of-work for finding minimal dominating set of a graph. IEEE 22^nd Int Conf on Trust, Security and Privacy in Computing and Communications, p.1332-1339.

[8]Chen L, Xu L, Shah N, et al., 2017. On security analysis of proof-of-elapsed-time (PoET). Proc 19^th Int Symp on Stabilization, Safety, and Security of Distributed Systems, p.282-297.

[9]Chen YF, Guo Y, Wang MY, et al., 2024. Securing IOTA blockchain against tangle vulnerability by using large deviation theory. IEEE Int Things J, 11(2):1952-1965.

[10]Cheng JX, Chen YZ, Cao YZ, et al., 2024. A vulnerability detection framework by focusing on critical execution paths. Inform Softw Technol, 174:107517.

[11]Coelho IM, Coelho VN, Araujo RP, et al., 2020. Challenges of PBFT-inspired consensus for blockchain and enhancements over Neo dBFT. Fut Int, 12(8):129.

[12]Eichelberger H, Sauer C, Ahmadian AS, et al., 2025. Industry 4.0/IIoT platforms for manufacturing systems—a systematic review contrasting the scientific and the industrial side. Inform Softw Technol, 179:107650.

[13]Escobar CC, Roy S, Kreidl OP, et al., 2022. Toward a green blockchain: engineering Merkle tree and proof of work for energy optimization. IEEE Trans Netw Serv Manag, 19(4):3847-3857.

[14]Eyal I, Gencer AE, Sirer EG, et al., 2016. Bitcoin-NG: a scalable blockchain protocol. 13^th USENIX Symp on Networked Systems Design and Implementation, p.45-59.

[15]Gadiraju DS, Lalitha V, Aggarwal V, 2023. An optimization framework based on deep reinforcement learning approaches for Prism blockchain. IEEE Trans Serv Comput, 16(4):2451-2461.

[16]Gilad Y, Hemo R, Micali S, et al., 2017. Algorand: scaling Byzantine agreements for cryptocurrencies. Proc 26^th Symp on Operating Systems Principles, p.51-68.

[17]Hu TY, Li BX, 2025. Dynamic information utilization for securing Ethereum smart contracts: a literature review. Inform Softw Technol, 182:107719.

[18]Jakobsson M, Juels A, 1999. Proofs of work and bread pudding protocols. In: Preneel B (Ed.), IFIP—The International Federation for Information Processing, Volume 23. Springer, Boston, p.258-272.

[19]Ji SY, Wu J, Qiu JF, et al., 2023. Effuzz: efficient fuzzing by directed search for smart contracts. Inform Softw Technol, 159:107213.

[20]Jia B, Zhou T, Li W, et al., 2018. A blockchain-based location privacy protection incentive mechanism in crowd sensing networks. Sensors, 18(11):3894.

[21]Jing N, Liu Q, Sugumaran V, 2021. A blockchain-based code copyright management system. Inform Process Manag, 58(3):102518.

[22]Keidar I, Kokoris-Kogias E, Naor O, et al., 2021. All you need is DAG. Proc ACM Symp on Principles of Distributed Computing, p.165-175.

[23]Kovalchuk L, Oliynykov R, Bespalov Y, et al., 2022. Comparative analysis of consensus algorithms using a directed acyclic graph instead of a blockchain, and the construction of security estimates of spectre protocol against double spend attack. In: Oliynykov R, Kuznetsov O, Lemeshko O, et al. (Eds.), Information Security Technologies in the Decentralized Distributed Networks. Lecture Notes on Data Engineering and Communications Technologies, Volume 115. Springer, Cham, p.203-224.

[24]Laatikainen G, Li MC, Abrahamsson P, 2023. A system-based view of blockchain governance. Inform Softw Technol, 157:107149.

[25]Lamport L, 2019. The part-time parliament. ACM Trans Comput Syst, 16(2):133-169.

[26]Lasla N, Al-Sahan L, Abdallah M, et al., 2022. Green-PoW: an energy-efficient blockchain proof-of-work consensus algorithm. Comput Netw, 214:109118.

[27]Liu X, Huang Z, Wang Q, et al., 2022. An optimized key-value Raft algorithm for satisfying linearizable consistency. Int Conf on Networking and Network Applications, p.522-527.

[28]Liu YR, Shi TJ, 2023. Improved A-Raft consensus algorithm based on SHA256 encryption algorithm. Int Conf on the Cognitive Computing and Complex Data, p.317-322.

[29]Ongaro D, Ousterhout J, 2014. In search of an understandable consensus algorithm. Proc USENIX Conf on USENIX Annual Technical Conf, p.305-320. https://dl.acm.org/doi/10.5555/2643634.2643666

[30]Shi CC, Xiang Y, Yu JS, et al., 2023. Machine translation-based fine-grained comments generation for solidity smart contracts. Inform Softw Technol, 153:107065.

[31]Shi HR, Chen ZH, Cheng YQ, et al., 2025. PB-Raft: a Byzantine fault tolerance consensus algorithm based on weighted PageRank and BLS threshold signature. Peer-to-Peer Netw Appl, 18(1):26.

[32]Sokal RR, Michener CD, 1958. A statistical method for evaluating systematic relationships. Univ Kans Sci Bull, 38(22):1409-1438.

[33]Sun WY, Bai XM, Shi BS, et al., 2025. TD-Raft: a consensus algorithm with inspection mechanism and server performance threshold. IAENG Int J Comput Sci, 52(4):1070-1076.

[34]Tang H, Yi WL, Zhao YD, et al., 2022. Improved Raft algorithm for optimizing authorized nodes based on random forest. XXV Int Conf on Soft Computing and Measurements, p.279-282.

[35]Treleaven P, Brown RG, Yang D, 2017. Blockchain technology in finance. Computer, 50(9):14-17.

[36]Ulukök MK, Sariyildiz İ, Evrim V, 2025. Hybrid Raft-PoW blockchain consensus algorithm. IEEE Access, 13:72067-72076.

[37]Wang Q, Yu JS, Peng ZN, et al., 2020. Security analysis on dBFT protocol of Neo. 24^th Int Conf on Financial Cryptography and Data Security, p.20-31.

[38]Ward JH Jr, 1963. Hierarchical grouping to optimize an objective function. J Am Stat Assoc, 58(301):236-244.

[39]Yamashita A, Tanaka M, Bessho Y, et al., 2023. Improving Raft performance with bulk transfers. 11^th Int Symp on Computing and Networking Workshops, p.38-44.

[40]Yang F, Zhou W, Wu QQ, et al., 2019. Delegated proof of stake with downgrade: a secure and efficient blockchain consensus algorithm with downgrade mechanism. IEEE Access, 7:118541-118555.

[41]Yang SJ, Tan PL, Fu HW, 2024. Improved Raft consensus algorithm based on NSGA-II and K-means++. 10^th Int Symp on System Security, Safety, and Reliability, p.383-390.

[42]Yin MF, Malkhi D, Reiter MK, et al., 2019. HotStuff: BFT consensus with linearity and responsiveness. Proc ACM Symp on Principles of Distributed Computing, p.347-356.

[43]Zhai D, Wang J, Liu JQ, et al., 2023. Efficient-HotStuff: a BFT blockchain consensus with higher efficiency and stronger robustness. 28^th Int Conf on Parallel and Distributed Systems, p.217-225.

[44]Zhang QF, Li H, 2007. MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput, 11(6):712-731.

[45]Zhao JJ, Chen X, Yang G, et al., 2024. Automatic smart contract comment generation via large language models and in-context learning. Inform Softw Technol, 168:107405.

[46]Zhao WB, 2023. On Nxt proof of stake algorithm: a simulation study. IEEE Trans Depend Sec Comput, 20(4):3546-3557.

Similar articles