Controlled Self-Recovery of the Aggregator in Federated Learning Using RAFT Protocol

Federated Learning (FL) has emerged as a decentralised machine learning paradigm for distributed systems, particularly in edge and IoT environments. However, achieving fault tolerance and self-recovery in such scenarios is challenging due to the centralised model aggregation, which poses a single point of failure. This paper focuses on the self-recovery of the aggregator, specifically the controlled re-assignment of the aggregator role to the most suitable node. Our proposed solution leverages the RAFT consensus algorithm to facilitate consistent state replication and leader election within the FL system. This is complemented by controlled aggregator re-assignment, which considers various contextual properties to select the optimal node, enhancing the system's robustness, especially in dynamic and unreliable cyber-physical environments. We implement a proof of concept using the Flower FL framework and conduct experiments to evaluate aggregator recovery time and the traffic overhead associated with state replication. While the traffic overhead scales with the number of FL nodes, our results demonstrate a resilient, self-recovering system capable of handling node failures while maintaining model consistency.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Autonomous and Adaptive Systems
Published
2025-12-18
DOI
https://doi.org/10.1145/3785470
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Controlled Self-Recovery of the Aggregator in Federated Learning Using RAFT Protocol

Erik Johannes Husom, Rustem Dautov
ACM Transactions on Autonomous and Adaptive Systems
Privacy-Preserving Technologies in Data
article

Controlled Self-Recovery of the Aggregator in Federated Learning Using RAFT Protocol

Erik Johannes Husom, Rustem Dautov
article en

Abstract

Federated Learning (FL) has emerged as a decentralised machine learning paradigm for distributed systems, particularly in edge and IoT environments. However, achieving fault tolerance and self-recovery in such scenarios is challenging due to the centralised model aggregation, which poses a single point of failure. This paper focuses on the self-recovery of the aggregator, specifically the controlled re-assignment of the aggregator role to the most suitable node. Our proposed solution leverages the RAFT consensus algorithm to facilitate consistent state replication and leader election within the FL system. This is complemented by controlled aggregator re-assignment, which considers various contextual properties to select the optimal node, enhancing the system's robustness, especially in dynamic and unreliable cyber-physical environments. We implement a proof of concept using the Flower FL framework and conduct experiments to evaluate aggregator recovery time and the traffic overhead associated with state replication. While the traffic overhead scales with the number of FL nodes, our results demonstrate a resilient, self-recovering system capable of handling node failures while maintaining model consistency.

ACM Transactions on Autonomous and Adaptive Systems
SINTEF (NO), SINTEF Digital
Openalex Percentile: Top 78%
Privacy-Preserving Technologies in Data
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Controlled Self-Recovery of the Aggregator in Federated Learning Using RAFT Protocol — Erik Johannes Husom, Rustem Dautov · ACM Transactions on Autonomous and Adaptive Systems (2025) | TGRS Research Map | TGRS