Resource-Efficient Joint Service Caching and Workload Scheduling in Ultra-Dense MEC Networks: An Online Approach

Jiaxin Zeng, Xiaobo Zhou, Keqiu Li · IEEE Transactions on Network and Service Management · 2024

Joint service caching and workload scheduling plays an important role in ultra-dense mobile edge computing (MEC) networks to satisfy the stringent requirements of latency-critical services by leveraging the aggregated edge resources (e.g., storage and computing resources) located near the users. However, most of the existing methods incorporating popularity-based and/or size-aware caching strategies fail to match the resource demands of user requests with the heterogeneous resources of edge nodes, leading to heavier cloud load and higher latency. It becomes even worse when user requests exhibit dynamic variations over time. To address these issues, we propose an online approach for resource-efficient joint service caching and workload scheduling in ultra-dense MEC networks, called CoShare. The core idea is to fully utilize the heterogeneous resources of the edge layer to further reduce the cloud load and thus the service latency. First, we formulate the joint service caching and workload scheduling problem as a mixed integer nonlinear programming problem with the goal of minimizing the cloud load. Then, an online algorithm is developed to transform this optimization problem into a series of per-slot sub-problems by leveraging Lyapunov optimization. Next, to solve these sub-problems, we design a cacheability-based alternating iterative algorithm utilizing Gibbs sampling, in which the cacheability indicator considers both service resource demands and service popularity. Finally, simulation results show that CoShare can effectively exploit available edge resources to achieve lower cloud loads compared to other strategies.

Read the paper · More papers on PaperTik