Demo Data from SIGIR 2026 / reviewers in the wild / expert
Huixian Gu
dblp:272/8557
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2026
0000-0003-4660-6465ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-author · 1 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
1 paper |
Edge and fog computing · 87% Wireless networking · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Edge and fog computing
mobile edge computing |
1.0 | 1 | 2026 | Joint Task Offloading and Resource Allocation in Ultra-Dense Multi-Access Edge Computing: A Mean Field Learning Approach · IEEE Trans. Mob. Comput. 2026 |
Edge and fog computing › mobile edge computing
task offloading and resource allocation |
1.0 | 1 | 2026 | Joint Task Offloading and Resource Allocation in Ultra-Dense Multi-Access Edge Computing: A Mean Field Learning Approach · IEEE Trans. Mob. Comput. 2026 |
Wireless networking › network deployment › network densification
ultra-dense networks |
0.3 | 1 | 2026 | Joint Task Offloading and Resource Allocation in Ultra-Dense Multi-Access Edge Computing: A Mean Field Learning Approach · IEEE Trans. Mob. Comput. 2026 |
Methods — techniques the papers use, named apart from their topics
reinforcement learning · 1.0mean field learning · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Joint Task Offloading and Resource Allocation in Ultra-Dense Multi-Access Edge Computing: A Mean Field Learning Approach
Huixian Gu, Zhu Han 0001, Xiaoli Chu, Gan Zheng 0001, Guorong Zhou |
IEEE Trans. Mob. Comput. | 1 |
| 2024 | Federated Deep Reinforcement Learning-enabled Task Offloading in Cloud-Edge-Terminal Collaborative NetworksabstractCloud-edge-terminal collaborative network (CETCN) has become a key enabler of the next generation wireless network. However, due to the privacy concern, terminals and the edge server may not will to leakage individual data to the cloud server. At the same time, limited computing capability of the edge server and terminals leads to long latency. Therefore, in this paper, we utilize a federated deep reinforce learning (DRL) algorithm named federated learning-based Double Deep Q Network (FL-DDQN) algorithm to solve the task offloading problem in CETCN. To be specific, firstly, we model the task offloading issue as the minimization problem of weighted energy consumption and latency of the CETCN with the constraints of subcarriers and maximum task processing latency. Secondly, we propose a DRL algorithm to obtain the suboptimal solution of the optimization problem. Thirdly, aiming to improve data security and reduce the working pressure of the terminals and the edge server, the FL-DDQN algorithm is further utilized, where the DDQN model is trained cooperatively in the terminals and the edge server. Finally the simulation result demonstrate that our proposed method superior to benchmark solutions in terms of total energy consumption and latency. Fanqi Yu, Bixia Tu, Huixian Gu, Yinxin Li, Miaoyu Lin, Haoyang Ding, Guorong Zhou |
VTC Spring | 4 |
| 2022 | Dynamic Game-based Caching Replacement in Edge NetworksabstractIn this paper, we design a caching replacement algorithm for edge networks to enhance the cache hit ratio of the edge network and reduce the traffic usage in the backbone network. Firstly, we design a dynamic-game model to represent the caching behavior between edge servers where each server takes the cache content of other servers into account to make their own caching decisions. Secondly, we analyze the utility function of edge servers from the perspective of caching contents. Finally, we derive the Nash equilibrium solution of the dynamic-game model and design a caching replacement algorithm to obtain the Nash equilibrium solution. Numerical results prove that the proposed edge caching replacement algorithm based on dynamic-game model improves the edge hit ratio up to 80% and meanwhile reduces 40% backbone traffic compared to the baseline solution. Huixian Gu, Weiwen Cai, Weimin Luo, Guorong Zhou, Haiyan Tu, Shuchun Li |
VTC Spring | 1 |