Lang Fan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lang Fan has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Xiaoning Zhang
School of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu, China
5 shared publications - Mingjun Duan
University of Electronic Science and Technology of China
4 shared publications - Zhihao Zeng
School of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu, China
3 shared publications - Keshav Sood
Deakin University
2 shared publications - Chenyu Fan
School of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu, China
1 shared publication - Haijun Zhang
University of Science and Technology Beijing
1 shared publication
Latest Publications
- 18 February 2026
- Published by Elsevier in Computer Networks
- Vol. 279
Self-Adaptive gradient transmission for decentralized federated learning in edge networks
- 18 February 2026
- Published by Elsevier in Computer Networks
- Vol. 279
Self-Adaptive gradient transmission for decentralized federated learning in edge networks
- 9 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 6293-6308
Joint Communication Topology Reconstruction and Parameter Filtering for Heterogeneous Decentralized Federated Learning
Federated learning (FL) has been strongly promoted in wireless edge networks because it facilitates collaborative training of machine learning models while ensuring the privacy and security of individual user data. Among different FL frameworks, Decentralized Federated Learning (DFL) framework offers greater flexibility and broader applicability compared to traditional Centralized Federated Learning (CFL) framework. However, existing DFL framework fails to accommodate the heterogeneity of multi-dimensional resources (e.g., communication and computing resources), and further suffer from high communication overhead. These limitations result in reduced training efficiency. To address these issues, this paper proposes SoloDFL, a framework integrating heterogeneity-aware communication topology reconstruction and parameter filtering. In SoloDFL, each client communicates with only one neighboring client, constructing a one-on-one communication topology, and exchanges only filtered local model parameters during communication. By doing so, SoloDFL copes with the synchronization barriers caused by system heterogeneity and further reduces communication overhead. The convergence of SoloDFL is proved theoretically. Extensive experiments show that SoloDFL achieves up to a $3.9\times $ acceleration and reduces communication costs by an average of 20.5% compared to the benchmark algorithms.
- 9 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 6293-6308
Joint Communication Topology Reconstruction and Parameter Filtering for Heterogeneous Decentralized Federated Learning
Federated learning (FL) has been strongly promoted in wireless edge networks because it facilitates collaborative training of machine learning models while ensuring the privacy and security of individual user data. Among different FL frameworks, Decentralized Federated Learning (DFL) framework offers greater flexibility and broader applicability compared to traditional Centralized Federated Learning (CFL) framework. However, existing DFL framework fails to accommodate the heterogeneity of multi-dimensional resources (e.g., communication and computing resources), and further suffer from high communication overhead. These limitations result in reduced training efficiency. To address these issues, this paper proposes SoloDFL, a framework integrating heterogeneity-aware communication topology reconstruction and parameter filtering. In SoloDFL, each client communicates with only one neighboring client, constructing a one-on-one communication topology, and exchanges only filtered local model parameters during communication. By doing so, SoloDFL copes with the synchronization barriers caused by system heterogeneity and further reduces communication overhead. The convergence of SoloDFL is proved theoretically. Extensive experiments show that SoloDFL achieves up to a $3.9\times $ acceleration and reduces communication costs by an average of 20.5% compared to the benchmark algorithms.
- 11 December 2025
- Published by Elsevier in Computer Networks
- Vol. 275
Adaptive computation control and model aggregation for parallel federated learning in heterogeneous edge networks
- 11 December 2025
- Published by Elsevier in Computer Networks
- Vol. 275
Adaptive computation control and model aggregation for parallel federated learning in heterogeneous edge networks
- 12 November 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 177
Joint client selection and epoch configuration for heterogeneity-aware federated learning in resource-constrained systems
- 12 November 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 177
Joint client selection and epoch configuration for heterogeneity-aware federated learning in resource-constrained systems
- 20 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 10 (1) , 277-291
Online Training Flow Scheduling for Geo-Distributed Machine Learning Jobs Over Heterogeneous and Dynamic Networks
Geo-Distributed Machine Leaning (Geo-DML) has been a promising technology, which performs collaborative learning across geographically dispersed data centers (DCs) with privacy-preserving over Wide Area Networks (WANs). Unfortunately, the limited and heterogeneous WAN bandwidth poses significant challenges to the performance of Geo-DML systems, leading to increased communication overhead and affecting the revenue of ISPs eventually. In particular, when multiple online jobs coexist in Geo-DML systems, the competition for bandwidth between training flows of different jobs aggravates this negative impact. To alleviate it, this paper investigates the problem of online training flow scheduling for Geo-DML jobs. We first formulate the studied problem as an Linear Programming (LP) model with the objective of maximizing the revenue of ISPs. Then, we propose an online traffic scheduling algorithm called Training Flow Adaptive Steering (TFAS), which exploits a primal-dual framework, tailored for efficient resource allocation of jobs to schedule training flows, such that system resources are maximally utilized and training procedures can be expedited and completed in a timely manner. Meanwhile, we conduct rigorous theoretical analysis to guarantee that the proposed algorithm can achieve a good competitive ratio. Extensive evaluation results demonstrate that our algorithm performs well and outperforms commonly adopted solutions 36.2%-49.4% in average.
- 20 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 10 (1) , 277-291
Online Training Flow Scheduling for Geo-Distributed Machine Learning Jobs Over Heterogeneous and Dynamic Networks
Geo-Distributed Machine Leaning (Geo-DML) has been a promising technology, which performs collaborative learning across geographically dispersed data centers (DCs) with privacy-preserving over Wide Area Networks (WANs). Unfortunately, the limited and heterogeneous WAN bandwidth poses significant challenges to the performance of Geo-DML systems, leading to increased communication overhead and affecting the revenue of ISPs eventually. In particular, when multiple online jobs coexist in Geo-DML systems, the competition for bandwidth between training flows of different jobs aggravates this negative impact. To alleviate it, this paper investigates the problem of online training flow scheduling for Geo-DML jobs. We first formulate the studied problem as an Linear Programming (LP) model with the objective of maximizing the revenue of ISPs. Then, we propose an online traffic scheduling algorithm called Training Flow Adaptive Steering (TFAS), which exploits a primal-dual framework, tailored for efficient resource allocation of jobs to schedule training flows, such that system resources are maximally utilized and training procedures can be expedited and completed in a timely manner. Meanwhile, we conduct rigorous theoretical analysis to guarantee that the proposed algorithm can achieve a good competitive ratio. Extensive evaluation results demonstrate that our algorithm performs well and outperforms commonly adopted solutions 36.2%-49.4% in average.