.png){kind=icon}
返回
Data Caching Optimization With Fairness in Mobile Edge Computing
.png){kind=icon}
PRE
AI
DOI：10.1109/TSC.2022.3197881.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Mobile edge computing (MEC) provides a new computing paradigm that can overcome the inability of the traditional cloud computing paradigm to ensure low service latency by pushing computing power and resources to the network edge. Many studies have attempted to formulate edge data caching strategies for app vendors to optimize caching performance by caching the right data on the right edge servers. However, existing edge data caching approaches have unfortunately ignored fairness, which is an important issue from the app vendor's perspective. In general, an app vendor needs to cache data on edge servers to serve its users with insignificant latency differences at a minimum caching cost. In this paper, we make the first attempt to tackle the fair edge data caching (FEDC) problem. Specifically, we formulate the FEDC problem as a constraint optimization problem (COP) and prove its $\mathcal {NP}$NP-hardness. An optimal approach named FEDC-OPT is proposed to find optimal solutions to small-scale FEDC problems with integer programming technique. In addition, an approximate algorithm named FEDC-APX is proposed to find approximate solutions in large-scale FEDC problems. The performance of the proposed approaches is analyzed theoretically, and evaluated experimentally on a widely-used real-world data set against four representative approaches. The experimental results show that the proposed approaches can solve the FEDC problem efficiently and effectively.
Keyword:
Approximation algorithm
edge data caching
fairness
integer programming
mobile edge computing
optimization
期刊
IF:
5.8
论文数:
2.2K
被引数:
6.5K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容