.png){kind=icon}
Return
Graph-based data caching optimization for edge computing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2020.07.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Edge computing has emerged as a new computing paradigm that allows computation and storage resources in the cloud to be distributed to edge servers. Those edge servers are deployed at base stations to provide nearby users with high-quality services. Thus, data caching is extremely important in ensuring low latency for service delivery in the edge computing environment. To minimize the data caching cost and maximize the reduction in service latency, we formulate this Edge Data Caching (EDC) problem as a constrained optimization problem in this paper. We prove the NP-completeness of this EDC problem and provide an optimal solution named IPEDC to solve this problem based on Integer Programming. Then, we propose an approximation algorithm named AEDC to find approximate solutions with a limited bound. We conduct intensive experiments on a real-world data set and a synthesized data set to evaluate our approaches. Our results demonstrate that IPEDC and AEDC significantly outperform the four representative baseline approaches. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Optimization
Edge computing
Edge data caching
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
F
IF:
6.1
Papers:
6.8K
Citations:
2.3W
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveShareSaveA Survey on Mobile Edge Networks: Convergence of Computing, Caching and Communications.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAIShareSave
View more