Xin Jin

Xin Jin

Auto-generated profile, based on publicly available information

Xin Jin

College of Computer Science, Beijing University of Technology, Beijing, China

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 May 2025 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
SLShuaibing Lu
Shuaibing Lu
XJXin Jin
Xin Jin
JWJie Wu
Jie Wu
SZShuyang Zhou
Shuyang Zhou
JYJackson Yang
Jackson Yang
Zhi CaiZhi Cai
Zhi Cai
In the context of mobile edge computing, achieving dynamic service caching and updating to guarantee the QoS of users and reduce system costs is a challenging problem. However, existing research still has certain deficiencies in considering the dynamic behavior of users and the limited storage resources of edge servers. To address this problem, this paper investigates optimizing the service caching and updating problem within multi-stage and proposes a novel framework with three proposed strategies for the different stages to jointly optimize the delay and cost. At the initial service caching stage, we propose a basic caching strategy based on dynamic programming for the single-area scenario, taking into account the constraint of limited memory resources. To improve the caching strategy, we extend our consideration to the multiple-area scenario and design an improved algorithm based on tabu search. Given the dynamic behavior of users, we formulate the joint optimization problem as a Markov Decision Process (MDP) and design a service extension strategy based on reinforcement learning at the service updating decision-making stage and a replacement strategy taking both the distribution of service replications and service access frequency into account at the service updating replacement stage to guarantee the QoS of users. We effectively tackle the challenges arising from the dynamic behavior of users and limited storage resources. Through extensive comparative experiments, our approach outperforms traditional strategies by significantly reducing user latency and system cost.