FRCR:Raft consensus scheme based on semi asynchronous federal reconstruction

Today, Raft's distributed cluster scale is growing rapidly and cluster throughput is declining. The Raft consensus algorithm needs to be continuously optimized to adapt to a complex and changeable application environment. To solve the above problems, we propose a federal reconstruction Committe...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE eTransactions on network and service management Jg. 19; H. 4; S. 1
Hauptverfasser: Rong, Baojun, Zheng, Zhaohui
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.12.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Clustering algorithms
Clusters
Committee
Data models
Distributed consensus
Elections
Federal reconstruction
Federated learning
Reconstruction
Security
Semi asynchronous aggregation
Servers
Training
Voting
ISSN:1932-4537, 1932-4537
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Today, Raft's distributed cluster scale is growing rapidly and cluster throughput is declining. The Raft consensus algorithm needs to be continuously optimized to adapt to a complex and changeable application environment. To solve the above problems, we propose a federal reconstruction Committee Raft consensus algorithm FRCR. Based on the Federation reconstruction technology, the algorithm trains, updates and evaluates the model of the characteristic data set of the Raft node, runs the model to get the nodes with better performance, constructs the committee mechanism, and improves the quality and speed of the election. We also design a semi asynchronous buffer mechanism and a strategy to resist malicious node attacks to solve the inconsistency and security problems of federation aggregation. Finally, seven aspects of FRCR are tested and analyzed to verify the effectiveness of FRCR in the consensus cluster.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1932-4537
1932-4537
DOI:10.1109/TNSM.2022.3217332