DRaft: A double-layer structure for Raft consensus mechanism

IF 7.7 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Journal of Network and Computer Applications Pub Date : 2025-01-20 DOI:10.1016/j.jnca.2025.104111

Jiaze Shang, Tianbo Lu, Yingjie Cai, Yanfang Li

{"title":"DRaft: A double-layer structure for Raft consensus mechanism","authors":"Jiaze Shang, Tianbo Lu, Yingjie Cai, Yanfang Li","doi":"10.1016/j.jnca.2025.104111","DOIUrl":null,"url":null,"abstract":"<div><div>The Raft consensus algorithm is based on the design of the leader, which simplifies the replication of logs and node changes. Unfortunately, the heavy responsibility of system interaction, including receiving requests from clients, transmitting heartbeats and entries, falls solely on the leader. A design with a strong leader can lead to an imbalance in the workload of nodes, thereby causing limited scalability. Additionally, the replication of a sole entry imposes constraints on the throughput.</div><div>To alleviate these bottlenecks, we put forward a new solution, DRaft, which employs a double-layer architecture and multi-entry replication. To enable DRaft, we revamp the leader change mechanism by introducing Fi-leader and Se-leaders. Moreover, we incorporate a cache-buffer module into DRaft to enable concurrent entry replication. We present a theoretical framework composed of the CPF and CNF models to analyze the consensus success probability of DRaft. We expand DRaft to multi-layer Raft, and discover that the relationship between communication complexity and the number of nodes is proportional. Finally, we implement and evaluate DRaft, comparing its throughput and latency with those of BRaft and Engraft. We show that when 12K TPS is achieved, the latency of BRaft is twice that of DRaft.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"236 ","pages":"Article 104111"},"PeriodicalIF":7.7000,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Network and Computer Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1084804525000086","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}

引用次数: 0

Abstract

The Raft consensus algorithm is based on the design of the leader, which simplifies the replication of logs and node changes. Unfortunately, the heavy responsibility of system interaction, including receiving requests from clients, transmitting heartbeats and entries, falls solely on the leader. A design with a strong leader can lead to an imbalance in the workload of nodes, thereby causing limited scalability. Additionally, the replication of a sole entry imposes constraints on the throughput.

To alleviate these bottlenecks, we put forward a new solution, DRaft, which employs a double-layer architecture and multi-entry replication. To enable DRaft, we revamp the leader change mechanism by introducing Fi-leader and Se-leaders. Moreover, we incorporate a cache-buffer module into DRaft to enable concurrent entry replication. We present a theoretical framework composed of the CPF and CNF models to analyze the consensus success probability of DRaft. We expand DRaft to multi-layer Raft, and discover that the relationship between communication complexity and the number of nodes is proportional. Finally, we implement and evaluate DRaft, comparing its throughput and latency with those of BRaft and Engraft. We show that when 12K TPS is achieved, the latency of BRaft is twice that of DRaft.

查看原文本刊更多论文

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Network and Computer Applications 工程技术-计算机：跨学科应用

CiteScore

21.50

自引率

3.40%

发文量

142

审稿时长

37 days

期刊介绍： The Journal of Network and Computer Applications welcomes research contributions, surveys, and notes in all areas relating to computer networks and applications thereof. Sample topics include new design techniques, interesting or novel applications, components or standards; computer networks with tools such as WWW; emerging standards for internet protocols; Wireless networks; Mobile Computing; emerging computing models such as cloud computing, grid computing; applications of networked systems for remote collaboration and telemedicine, etc. The journal is abstracted and indexed in Scopus, Engineering Index, Web of Science, Science Citation Index Expanded and INSPEC.