Imagen de Portada

Cache‐Assisted Offloading Optimization for Edge Computing Tasks

Guardado en:
Publicado en:IET Communications vol. 19, no. 1 (Jan/Dec 2025)
Autor principal: Liu, Hao
Otros Autores: Zhen, Yan, Zheng, Libin, Huo, Chao, Zhang, Yu
Publicado:
John Wiley & Sons, Inc.
Materias:
Dynamic programming
User behavior
Collaboration
User experience
Caching
Edge computing
Costs
Optimization
Mobile computing
Computation offloading
Decomposition
Algorithms
Resource utilization
Cloud computing
Time
Energy consumption
Knapsack problem
Acceso en línea:Citation/Abstract
Full Text
Full Text - PDF
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Resumen:ABSTRACT Mobile edge computing (MEC) serves as a feasible architecture that brings computation closer to the edge, enabling rapid response to user demands. However, most research on task offloading (TO) overlooks the scenario of repetitive requests for the same computing tasks during long time slots, and the spatiotemporal disparities in user demands. To address this gap, in this paper, we first introduce edge caching into TO and then divide base stations (BSs) into different communities based on the regional characteristics of user demands and activity areas, enabling collaborative caching among BSs within the same community. Subsequently, we design a dual timescale to update task popularity within both short and long‐term time slots. To maximize cache benefits, we construct a model that transforms the caching issue into a 0–1 knapsack problem, and employ dynamic programming to obtain offloading strategies. Simulation results confirm the efficiency of the proposed task caching policy algorithm, and it effectively reduces the offloading cost and improves cache resource utilization compared to the other three baseline algorithms.In this paper, we first introduce edge caching into TO and then divide BSs into different communities based on the regional characteristics of user demands and activity areas, enabling collaborative caching among BSs within the same community. Subsequently, we design a dual timescale to update task popularity within both short and long‐term time slots. To maximize cache benefits, we construct a model that transforms the caching issue into a 0–1 knapsack problem and employ dynamic programming to obtain offloading strategies.
ISSN:1751-8628
1751-8636
DOI:10.1049/cmu2.70089
Fuente:Advanced Technologies & Aerospace Database