FedQS: asynchronous federated learning based on queue scheduling

Counts differ because each database indexes a different set of publications. We treat OpenAlex as the canonical count; Google Scholar is not shown (no API, and crawling it violates its ToS).

With the rapid development of the Internet of Things (IoT) and edge computing, Federated Learning (FL) has emerged as a promising distributed framework capable of effectively leveraging distributed devices for machine learning tasks while preserving data privacy. However, in practical scenarios characterized by significant device heterogeneity and communication delays, traditional synchronous FL often suffers from inefficiency due to the straggler effect. Although Asynchronous Federated Learning (AFL) has been proposed to mitigate this, it still faces challenges regarding model staleness and training bias, which hinder convergence performance. To address these issues, this paper presents an asynchronous framework named FedQS . First, FedQS employs a multi-dimensional staleness evaluation mechanism that dynamically assesses updates by combining the similarity between local and global models with client latency metrics. Second, to resolve the coupling between training bias and model staleness, we implement a decoupling solution via a queue scheduling algorithm. This algorithm reprocesses high-staleness model parameters on selected faster helper clients using only the helpers’ local private data while preserving the provenance of the original uploading clients, thereby aiming to reduce stale-update effects in aggregation. Finally, during the aggregation phase, the framework recalibrates aggregation weights based on client contributions to reduce training bias and improve global model accuracy. Comparative experiments on Fashion-MNIST and CIFAR-10 datasets demonstrate that FedQS outperforms four evaluated representative baselines—FedAsync, FedBuff, KAFL, and CAFL—achieving an average accuracy improvement of 8.62%.