Zheng Shao jie

Mr. Zheng Shao jie

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
24 July 2023 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
LCLong CHEN
Long CHEN
ZJZheng Shao jie
Zheng Shao jie
YWYalan Wu
Yalan Wu
Hong-Ning DaiHong-Ning Dai
Hong-Ning Dai
JWJigang Wu
Jigang Wu
Intelligent edge services should consider not only service provider’s resource constraints but also end user’s quality of experience (QoE) demands. In this regard, we study a digital twin service caching and request routing problem with consideration of both resource and fairness-awareness under the collaboration of multi-access edge computing (MEC) servers. We first formulate the problem as an integer nonlinear programming by maximizing the minimum task completion ratio when there are multiple heterogeneous digital twin services, subject to computation, storage, and heterogeneous task delay constraints. Then, we propose an online stochastic randomized rounding algorithm (ORA) and an efficient online greedy algorithm (OGA) to solve the formulated problem. Extensive simulation results demonstrate the effectiveness of the proposed ORA and OGA algorithms in terms of the minimum application completion ratio.

30 May 2025 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
LCLong CHEN
Long CHEN
ZJZheng Shao jie
Zheng Shao jie
JWJigang Wu
Jigang Wu
Hong-Ning DaiHong-Ning Dai
Hong-Ning Dai
DNDusit Niyato
Dusit Niyato
JHJiale Huang
Jiale Huang
Inadequate resource coordination and control can result in poor quality of experience (QoE) for user devices in heterogeneous edge-enabled cyber-physical systems. Unfortunately, in a cooperative edge network, existing studies have rarely jointly optimized communication, computing resources, and batch size for QoE guarantee when controlling task offloading. To this end, we investigate the problem of harnessing bandwidth, computation, and batch size for fair quality of experience (HARBOR) in a practical collaborative edge-AI environment, where UEs have different accuracy requirements of inference services and edge devices possess different batch processing capabilities. Specifically, we introduce the task completion efficiency as the task-completion-time-to-deadline ratio to quantify individual QoE. Then, we formulate the problem HARBOR as a mixed integer nonlinear programming with constraints of accuracy, bandwidth, computation, task hard deadlines and so on. The objective is to minimize the maximum task completion efficiency among all tasks to achieve task-level fairness. After providing the NP-hardness proof for HARBOR, we then devise an efficient scheme named e-HARBOR with a competitive ratio guarantee, to solve the decoupled sub-problems of HARBOR with calibrated long short-term memory network for resource prediction. Both testbed and simulation experiments evidently demonstrate that the proposed scheme works efficiently and scales well compared to baselines.

18 July 2024 in Sensors
Verified
Journal Article
Open access
PDF file
CZChuangqiang Zhan
Chuangqiang Zhan
ZJZheng Shao jie
Zheng Shao jie
JCJingyu Chen
Jingyu Chen
JLJiachao Liang
Jiachao Liang
XZXiaoJie Zhou
XiaoJie Zhou
Edge servers frequently manage their own offline digital twin (DT) services, in addition to caching online digital twin services. However, current research often overlooks the impact of offline caching services on memory and computation resources, which can hinder the efficiency of online service task processing on edge servers. In this study, we concentrated on service caching and task offloading within a collaborative edge computing system by emphasizing the integrated quality of service (QoS) for both online and offline edge services. We considered the resource usage of both online and offline services, along with incoming online requests. To maximize the overall QoS utility, we established an optimization objective that rewards the throughput of online services while penalizing offline services that miss their soft deadlines. We formulated this as a utility maximization problem, which was proven to be NP-hard. To tackle this complexity, we reframed the optimization problem as a Markov decision process (MDP) and introduced a joint optimization algorithm for service caching and task offloading by leveraging the deep Q-network (DQN). Comprehensive experiments revealed that our algorithm enhanced the utility by at least 14.01% compared with the baseline algorithms.