Demo Data from SIGIR 2026 / reviewers in the wild / expert
Xiangchun Chen
dblp:372/2856
· DBLP profile ↗
4ranked-venue papers
3as first author
4since 2021 · last 2026
0000-0003-4366-6243ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 first-author · 2 since 2021Computer networks · 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 · 100% | |
| Artificial intelligence
1 paper |
Reinforcement learning · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Edge and fog computing › mobile edge computing
computation offloading |
1.9 | 2 | 2026 | Decentralized Task Offloading in Collaborative Edge Computing: A Digital Twin Assisted Multi-Agent Reinforcement Learning Approach · IEEE Trans. Mob. Comput. 2026 Mobility-Aware Dependent Task Offloading in Edge Computing: A Digital Twin-Assisted Reinforcement Learning Approach · IEEE Trans. Mob. Comput. 2025 |
Machine learning › Reinforcement learning
multi-agent reinforcement learning |
1.0 | 1 | 2026 | Decentralized Task Offloading in Collaborative Edge Computing: A Digital Twin Assisted Multi-Agent Reinforcement Learning Approach · IEEE Trans. Mob. Comput. 2026 |
Edge and fog computing
collaborative edge computing |
1.0 | 1 | 2026 | Decentralized Task Offloading in Collaborative Edge Computing: A Digital Twin Assisted Multi-Agent Reinforcement Learning Approach · IEEE Trans. Mob. Comput. 2026 |
Edge and fog computing
digital twin |
0.3 | 1 | 2026 | Decentralized Task Offloading in Collaborative Edge Computing: A Digital Twin Assisted Multi-Agent Reinforcement Learning Approach · IEEE Trans. Mob. Comput. 2026 |
Edge and fog computing › digital twin
digital twin-assisted edge computing |
0.3 | 1 | 2025 | Mobility-Aware Dependent Task Offloading in Edge Computing: A Digital Twin-Assisted Reinforcement Learning Approach · IEEE Trans. Mob. Comput. 2025 |
Methods — techniques the papers use, named apart from their topics
digital twin · 2.9multi-agent reinforcement learning · 2.0deep reinforcement learning · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Efficient KV Cache Migration for Geo-Distributed LLM Inference in Collaborative Edge Computing
Mingjin Zhang, Jiannong Cao 0001, Xiangchun Chen, Ne Wang |
ICDCS | 4 |
| 2026 | Decentralized Task Offloading in Collaborative Edge Computing: A Digital Twin Assisted Multi-Agent Reinforcement Learning ApproachabstractDecentralized Edge Computing (DEC) has emerged as a computing paradigm leveraging computational resources of edge nodes for complex, data-intensive applications. Decentralized task offloading decides when and at which edge node each task is executed without a central coordinator. However, ensuring reliability for decentralized task offloading is crucial, especially in critical applications like video analytics. Existing centralized approaches often face single points of failure and high communication overhead. Current decentralized methods often ignore task dependencies and bandwidth allocation, leading to suboptimal resource utilization and low reliability. We address the Reliability-aware Dependent Task Offloading (RDTO) problem in DEC, jointly optimizing bandwidth allocation, to maximize task success rate. The challenge of RDTO lies in optimizing dynamic task offloading and bandwidth allocation with task dependencies. We propose a Digital Twin assisted Multi-agent Reinforcement Learning (DT-MARL) algorithm. Our approach integrates a novel digital twin model that provides real-time estimation of task completion time and edge node failure rates. By integrating digital twin with multi-agent reinforcement learning, we enable each edge node to make informed decisions for offloading strategies, effectively improving the task success rate. Extensive experiments using real-world and synthetic datasets demonstrate that DT-MARL outperforms state-of-the-art baselines on task success rate up to 32.00% and 32.43%, respectively. Xiangchun Chen, Jiannong Cao 0001, Yuvraj Sahni, Mingjin Zhang, Yusheng Ji |
IEEE Trans. Mob. Comput. | 1 |
| 2025 | Mobility-Aware Dependent Task Offloading in Edge Computing: A Digital Twin-Assisted Reinforcement Learning ApproachabstractCollaborative edge computing (CEC) has emerged as a promising paradigm, enabling edge nodes to collaborate and execute tasks from end devices. Task offloading is a fundamental problem in CEC that decides when and where tasks are executed upon the arrival of tasks. However, the mobility of users often results in unstable connections, leading to network failures and resource underutilization. Existing works have not adequately addressed joint mobility-aware dependent task offloading and network flow scheduling, resulting in network congestion and suboptimal performance. To address this, we formulate an online joint mobility-aware dependent task offloading and bandwidth allocation problem, to improve the quality of service by reducing task completion time and energy consumption. We introduce a Mobility-aware Digital Twin-assisted Deep Reinforcement Learning (MDT-DRL) algorithm. Our digital twin model equips the reinforcement learning process by providing future states of mobile users, enabling efficient offloading plans for adapting to the mobile CEC system. Experimental results on real-world and synthetic datasets show that MDT-DRL surpasses state-of-the-art baselines on average task completion time and energy consumption. Xiangchun Chen, Jiannong Cao 0001, Yuvraj Sahni, Mingjin Zhang, Zhixuan Liang, Lei Yang 0024 |
IEEE Trans. Mob. Comput. | 1 |
| 2024 | Dynamic Task Offloading in Edge Computing Based on Dependency-Aware Reinforcement LearningabstractCollaborative edge computing (CEC) is an emerging computing paradigm in which edge nodes collaborate to perform tasks from end devices. Task offloading decides when and at which edge node tasks are executed. Most existing studies assume task profiles and network conditions are known in advance, which can hardly adapt to dynamic real-world computation environments. Some learning-based methods use online task offloading without considering task dependency and network flow scheduling, leading to underutilized resources and flow congestion. We study Online Dependent Task Offloading (ODTO) in CEC, jointly optimizing network flow scheduling to optimize quality of service by reducing task completion time and energy consumption. The challenge of ODTO lies in how to offload dependent tasks and schedule network flows in dynamic networks. We model ODTO as the Markov Decision Process (MDP) and propose an Asynchronous Deep Progressive Reinforcement Learning (ADPRL) approach that optimizes offloading and bandwidth decisions. We design a novel dependency-aware reward mechanism to address task dependency and dynamic networks. Extensive experiments on the Alibaba cluster trace dataset and synthetic dataset indicate that our algorithm outperforms heuristic and learning-based methods in average task completion time and energy consumption. Xiangchun Chen, Jiannong Cao 0001, Yuvraj Sahni, Shan Jiang 0005, Zhixuan Liang |
IEEE Trans. Cloud Comput. | 1 |