Dynatune: Dynamic Tuning of Raft Election Parameters Using Network Measurement
Kohya Shiozaki, Junya Nakamura

TL;DR
Dynatune dynamically tunes Raft's election parameters based on real-time network measurements, significantly reducing leader election time and service downtime without extra communication overhead.
Contribution
It introduces a novel mechanism that adaptively adjusts Raft's election parameters using network metrics, improving performance under fluctuating network conditions.
Findings
Reduces leader failure detection time by 80%.
Decreases out-of-service time by 45%.
Maintains high availability in dynamic networks.
Abstract
Raft is a leader-based consensus algorithm that implements State Machine Replication (SMR), which replicates the service state across multiple servers to enhance fault tolerance. In Raft, the servers play one of three roles: leader, follower, or candidate. The leader receives client requests, determines the processing order, and replicates them to the followers. When the leader fails, the service must elect a new leader to continue processing requests, during which the service experiences an out-of-service (OTS) time. The OTS time is directly influenced by election parameters, such as heartbeat interval and election timeout. However, traditional approaches, such as Raft, often struggle to effectively tune these parameters, particularly under fluctuating network conditions, leading to increased OTS time and reduced service responsiveness. To address this, we propose Dynatune, a mechanism…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
