Demo Data from EDBT 2026 / reviewers in the wild / expert
Songli Zhang
dblp:320/9067
· DBLP profile ↗
5ranked-venue papers
4as first author
5since 2021 · last 2025
0000-0001-6828-9347ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3 · 2 first-author · 3 since 2021Systems, architecture and hardware · 2 · 2 first-author · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer networks
2 papers |
Edge and fog computing · 71% Wireless networking · 29% | |
| Artificial intelligence
1 paper |
Efficient and distributed learning · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
federated learning |
0.9 | 1 | 2025 | MIDDLE: A Mobility-Driven Device-Edge-Cloud Federated Learning Framework · IEEE Trans. Mob. Comput. 2025 |
Machine learning › Efficient and distributed learning › federated learning
hierarchical federated learning |
0.9 | 1 | 2025 | MIDDLE: A Mobility-Driven Device-Edge-Cloud Federated Learning Framework · IEEE Trans. Mob. Comput. 2025 |
Wireless networking › scheduling › real-time scheduling
deadline-aware scheduling |
0.7 | 1 | 2023 | Cost-Effective Scheduling for Dependent Tasks With Tight Deadline Constraints in Mobile Edge Computing · IEEE Trans. Mob. Comput. 2023 |
Edge and fog computing › task scheduling
dependent task scheduling |
0.7 | 1 | 2023 | Cost-Effective Scheduling for Dependent Tasks With Tight Deadline Constraints in Mobile Edge Computing · IEEE Trans. Mob. Comput. 2023 |
Edge and fog computing
mobile edge computing |
0.7 | 1 | 2023 | Cost-Effective Scheduling for Dependent Tasks With Tight Deadline Constraints in Mobile Edge Computing · IEEE Trans. Mob. Comput. 2023 |
Edge and fog computing › multi-tier computing
end-edge-cloud computing |
0.3 | 1 | 2025 | MIDDLE: A Mobility-Driven Device-Edge-Cloud Federated Learning Framework · IEEE Trans. Mob. Comput. 2025 |
Cloud and datacenter computing › computation offloading
cloud offloading |
0.2 | 1 | 2023 | Cost-Effective Scheduling for Dependent Tasks With Tight Deadline Constraints in Mobile Edge Computing · IEEE Trans. Mob. Comput. 2023 |
Methods — techniques the papers use, named apart from their topics
on-device model aggregation · 1.7in-edge device selection · 1.7global control averaging · 1.7simulation · 1.3deadline distribution · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | MIDDLE: A Mobility-Driven Device-Edge-Cloud Federated Learning FrameworkabstractFederated learning (FL) can be implemented in large-scale wireless networks in a hierarchical way, introducing edge servers as relays between the cloud server and devices. These devices are dispersed within multiple clusters coordinated by edges. However, the devices are typically mobile users with unpredictable trajectories, and the impact of their mobility on the model training process is not well-studied. In this work, we propose a newMobIlity-Driven feDeratedLEarning framework, namely MIDDLE. MIDDLE addresses unbalanced model updates by capitalizing on model aggregation opportunities on mobile devices due to their mobility across edges. It consists of two components: on-device model aggregation, which aggregates models from different edges carried by mobile devices as they move across edges, and in-edge device selection, adjusting the current edge optimization direction through careful device selection. Theoretical analysis emphasizes that on-device model aggregation can reduce bias in model updating on edges and the cloud, thereby accelerating the FL model convergence. Building on this analysis, we introduce on-device global control averaging, modifying the training process on mobile devices and extending MIDDLE into$\text{MIDDLE}^{+}$. Extensive experimental results validate that MIDDLE and$\text{MIDDLE}^{+}$can reduce the time steps to reach the target accuracy by 19.44% and 20.37% at least, respectively. Songli Zhang, Zhenzhe Zheng 0001, Fan Wu 0006, Bingshuai Li, Yunfeng Shao 0001, Guihai Chen |
IEEE Trans. Mob. Comput. | 1 |
| 2024 | Mobility-Aware Device Sampling for Statistical Heterogeneity in Hierarchical Federated LearningabstractHierarchical Federated Learning (HFL) is a practical implementation of federated learning in mobile edge computing, employing edge servers as intermediaries between mobile devices and the cloud server for device coordination and cloud communication. However, the devices are usually mobile users with unpredictable mobile trajectories and statistical heterogeneity, leading to the edge models optimized along dynamic edge data distribution directions and further resulting in instability and slow convergence of the global model. In this work, we propose a Mobility-Aware deviCe sampling algorithm in HFL, namely MACH, which can dynamically maintain the device sampling strategy at each edge to accelerate the convergence of the global model. First, we analyze the convergence bound of HFL with mobile devices under arbitrary device sampling probabilities. Based on this convergence bound, we formalize the sampling optimization problem for mobility-aware device sampling, aiming to minimize the convergence error under time-averaged cost constraints, while taking the limited device-edge wireless channel capacity into account. Next, we introduce the MACH algorithm, consisting of two underlying components: experience updating and edge sampling. Experience updating utilizes an upper confidence bound method to estimate device statistical information online, and edge sampling customizes a sampling strategy on each edge based on the estimated device statistical information. Finally, extensive experimental results through real-world mobile device trajectories validate that MACH can reduce the time required to achieve a target accuracy by 25.00% - 56.86%. Songli Zhang, Zhenzhe Zheng 0001, Qinya Li, Fan Wu 0006, Guihai Chen |
ICDCS | 1 |
| 2023 | Learning From Your Neighbours: Mobility-Driven Device-Edge-Cloud Federated LearningabstractFederated learning (FL) in large-scale wireless networks is implemented in a hierarchical way by introducing edge servers as relays between the cloud server and devices, where devices are dispersed within multiple clusters coordinated by edges. However, the devices are usually mobile users with unpredictable mobile trajectories, whose effects on the model training process are still less studied. In this work, we propose a new MobIlity-Driven feDerated LEarning framework, namely MIDDLE in wireless networks, which can relieve unbalanced and biased model updates by leveraging the new model aggregation opportunities on mobile devices due to their mobility across edges. Specifically, mobile devices can have different models while traversing across edges, and adequately aggregate these models on the device. By theoretical analysis, we can show that this on-device model aggregation can reduce the bias of model updating on edges and cloud, and then accelerate the convergence of model training in FL. Then, we define a model similarity utility to measure the difference in gradient updates among various models, which guides the adaptive on-device model aggregation and in-edge device selection to facilitate the comprehensive information sharing between edges. Extensive experiment results validate that MIDDLE can achieve 1.51 × −6.85 × speedup on the model training, compared with the state-of-the-art model training approaches in hierarchical FL. Songli Zhang, Zhenzhe Zheng 0001, Fan Wu 0006, Bingshuai Li, Yunfeng Shao 0001, Guihai Chen |
ICPP | 1 |
| 2023 | Cost-Effective Scheduling for Dependent Tasks With Tight Deadline Constraints in Mobile Edge ComputingabstractIn Mobile Edge Computing (MEC), latency-sensitive mobile applications comprising dependent tasks can be scheduled to edge or cloud servers to reduce latency and execution costs. However, existing algorithms based on deadline distribution can hardly satisfy tight application deadlines in heterogeneous MEC due to lacking a global view of the future impacts on descendant tasks. To fill in this gap, we formulate the deadline-constrained cost optimization problem for dependent task scheduling in MEC and propose a low-complexity scheduling algorithm that considers a single task's future impacts in two stages. Specifically: (1) In the edge scheduling stage, each task is scheduled according to its successors’ latest start times instead of its sub-deadline to alleviate the lateness of its successors. An edge-only schedule plan is generated by scheduling tasks only on edge servers to save execution costs. (2) In the cloud offloading stage, in order to utilize the powerful cloud resources to satisfy the deadline, the edge-only schedule plan missing the deadline is efficiently modified by properly offloading multiple successive tasks to the cloud. Simulation results show the substantial advantage of the proposed algorithm over baselines in both online and offline scenarios. Jiong Lou, Zhiqing Tang, Songli Zhang, Weijia Jia 0001, Wei Zhao 0001, Jie Li 0002 |
IEEE Trans. Mob. Comput. | 3 |
| 2022 | Efficient instance reuse approach for service function chain placement in mobile edge computing
Songli Zhang, Weijia Jia 0001, Zhiqing Tang, Jiong Lou, Wei Zhao 0001 |
Comput. Networks | 1 |