Non-Blocking Raft for High Throughput IoT Data
Tian Jiang, Xiangdong Huang, Shaoxu Song, Chen Wang, Jianmin Wang, Ruibo Li, Jincheng Sun
Abstract
The Raft consensus protocol naturally fits time series databases, owing to the resemblance between its continuous log and the time series data. While the serialization of appending entries reduces the state space for ease design and implementation, it blocks the subsequent requests and thus limits the parallelism and throughput of Raft. Intuitively, once an entry arrives the follower, we may notice the leader and the client to unblock the subsequent as early, rather than waiting for its appending and committing. In this way, more requests can be processed in parallel, and thus the throughput increases, essential for IoT applications often with vast sensors and fast data ingestion. Of course, with higher parallelism, the risk of persistence for in-processing entries increases. It is a worthwhile trade-off in the IoT scenario since tiny data loss during leader failure is more acceptable than shutting out most data due to a low throughput. Our Non-Blocking Raft (NB-Raft) is implemented as the consensus protocol of Apache IoTDB, a commodity time series database management system, supporting various applications in Alibaba Cloud. Extensive evaluation shows that the throughput is improved by about 30% using our NB-Raft compared to the original Raft, a considerable amount of further data saved.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b18c615b-424d-474c-abc4-0e23d78d7c3aCited by top-tier papers1
Ask how each one uses itBuilds on4
- PigPaxos: Devouring the Communication Bottlenecks in Distributed ConsensusAleksey Charapko, Ailidani Ailijiang, Murat DemirbasSIGMOD 2021 · 55 citations
- CRaft: An Erasure-coding-supported Version of Raft for Reducing Storage Cost and Network CostZizhong Wang, Tongliang Li, Haixia Wang, Airan Shao et al.FAST 2020 · 42 citations
- On Repairing Timestamps for Regular Interval Time SeriesChenguang Fang, Shaoxu Song, Yinan MeiVLDB 2022 · 18 citations
- Imputing Various Incomplete Attributes via Distance Likelihood MaximizationShaoxu Song, Yu SunKDD 2020 · 15 citations
Related papers
- Migration-Free Elastic Storage of Time Series in Apache IoTDBRongzhao Chen, Xiangpeng Hu, Xiangdong Huang, Chen Wang et al.VLDB 2025
- On Reducing Space Amplification with Multi-Column Compaction in Apache IoTDBChenguang Fang, Zijie Chen, Shaoxu Song, Xiangdong Huang et al.VLDB 2024 · 1 citation
- Time Series Data Encoding for Efficient Storage: A Comparative Analysis in Apache IoTDBJinzhao Xiao, Yuxiang Huang, Changyu Hu, Shaoxu Song et al.VLDB 2022 · 37 citations
- LeaseGuard: Raft Leases Done RightA. Jesse Jiryu Davis, Murat Demirbas, Lingzhi DengSIGMOD 2026 · 2 citations
- In-Database Time Series ClusteringYunxiang Su, Kenny Ye Liang, Shaoxu SongSIGMOD 2025 · 3 citations
