TY - GEN
T1 - Cost-aware variable-size-content caching in MEC-enabled mobile wireless networks
AU - Zhang, Xiaopei
AU - Du, Qinghe
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/7/2
Y1 - 2018/7/2
N2 - This paper proposes a proactive cache-replacing scheme in mobile-edge-computing (MEC)-enabled mobile wireless networks, which targets at decreasing the caching costs when offering convenient data access for mobile users. The main features of our scheme, termed Cost-Aware Variable-Size Caching (CAVSC), include three folds: 1) joint consideration of content sizes and user-access frequencies in characterizing the content popularity; 2) adaptive content clustering to ease the popularity prediction; 3) the size-aware cache-replacing strategy. In particular, our CAVSC scheme regularly performs adaptive clustering, which dynamically categories the data contents into classes according to user-access frequencies. Every time upon the receipt of a new user's request, our CAVSC scheme predicts the popularity as the weighted product of the access frequency and size of the corresponding data contents, where the weights reflect the accuracy of our preceding prediction. Then, our scheme conducts cache replacement by jointly considering the updated popularity as well as sizes of contents. Simulations evaluations show that our CAVSC scheme outperforms the baseline schemes in terms of caching cost.
AB - This paper proposes a proactive cache-replacing scheme in mobile-edge-computing (MEC)-enabled mobile wireless networks, which targets at decreasing the caching costs when offering convenient data access for mobile users. The main features of our scheme, termed Cost-Aware Variable-Size Caching (CAVSC), include three folds: 1) joint consideration of content sizes and user-access frequencies in characterizing the content popularity; 2) adaptive content clustering to ease the popularity prediction; 3) the size-aware cache-replacing strategy. In particular, our CAVSC scheme regularly performs adaptive clustering, which dynamically categories the data contents into classes according to user-access frequencies. Every time upon the receipt of a new user's request, our CAVSC scheme predicts the popularity as the weighted product of the access frequency and size of the corresponding data contents, where the weights reflect the accuracy of our preceding prediction. Then, our scheme conducts cache replacement by jointly considering the updated popularity as well as sizes of contents. Simulations evaluations show that our CAVSC scheme outperforms the baseline schemes in terms of caching cost.
KW - Content Caching
KW - K-means Clustering
KW - Mobile Edge Computing
UR - https://www.scopus.com/pages/publications/85062865891
U2 - 10.1109/APCC.2018.8633513
DO - 10.1109/APCC.2018.8633513
M3 - 会议稿件
AN - SCOPUS:85062865891
T3 - 2018 24th Asia-Pacific Conference on Communications, APCC 2018
SP - 498
EP - 502
BT - 2018 24th Asia-Pacific Conference on Communications, APCC 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 24th Asia-Pacific Conference on Communications, APCC 2018
Y2 - 12 November 2018 through 14 November 2018
ER -