
Fei ZHAO, Guilong PENG, Tianyi ZANG. MH-Raft: an efficient and low-latency consensus algorithm for distributed systems via MOEA/D and hybrid hierarchical clustering[J]. Journal of Zhejiang University Science C, 1998, -1(-1): .
@article{title="MH-Raft: an efficient and low-latency consensus algorithm for distributed systems via MOEA/D and hybrid hierarchical clustering",
author="Fei ZHAO, Guilong PENG, Tianyi ZANG",
journal="Journal of Zhejiang University Science C",
volume="-1",
number="-1",
pages="",
year="1998",
publisher="Zhejiang University Press & Springer",
doi="10.1631/ENG.ITEE.2025.0043"
}
%0 Journal Article
%T MH-Raft: an efficient and low-latency consensus algorithm for distributed systems via MOEA/D and hybrid hierarchical clustering
%A Fei ZHAO
%A Guilong PENG
%A Tianyi ZANG
%J Journal of Zhejiang University SCIENCE C
%V -1
%N -1
%P
%@ 1869-1951
%D 1998
%I Zhejiang University Press & Springer
%DOI 10.1631/ENG.ITEE.2025.0043
TY - JOUR
T1 - MH-Raft: an efficient and low-latency consensus algorithm for distributed systems via MOEA/D and hybrid hierarchical clustering
A1 - Fei ZHAO
A1 - Guilong PENG
A1 - Tianyi ZANG
J0 - Journal of Zhejiang University Science C
VL - -1
IS - -1
SP -
EP - 0
%@ 1869-1951
Y1 - 1998
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/ENG.ITEE.2025.0043
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.
CLC number:
On-line Access: 2026-05-07
Received: 2025-09-19
Revision Accepted: 2026-03-22
Crosschecked: 0000-00-00
Cited: 0
Clicked: 20
Open peer comments: Debate/Discuss/Question/Opinion
<1>