arrow
返回

DeepMEC: Mobile Edge Caching Using Deep Learning

delete2018-01-01
delete44
delete
OA
AI
K
Kyi Thar
N
Nguyen H. Tran
T
Thant Zin Oo
C
Choong Seon Hong *
DOI:10.1109/ACCESS.2018.2884913delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Caching popular contents at edge nodes such as base stations is a crucial solution for improving users' quality of services in next-generation networks. However, it is very challenging to correctly predict the future popularity of contents and decide which contents should be stored in the base station cache. Recently, with the advances in big data and high computing power, deep learning models have achieved high prediction accuracy. Hence, in this paper, deep learning is used to learn and predict the future popularity of contents to support cache decision. First, deep learning models are trained and utilized in the cloud data center to make an efficient cache decision. Then, the final cache decision is sent to each base station to store the popular contents proactively. The proposed caching scheme involves three distinct parts: 1) predicting the future class label of each content; 2) predicting the future popularity score of contents based on the predicted class label; and 3) caching the predicted contents with high popularity scores. The prediction models using the Keras and Tensorflow libraries are implemented in this paper. Finally, the performance of the caching schemes is tested with a Python-based simulator. In terms of a cache hit, simulation results show that the proposed scheme outperforms 38%, convolutional recurrent neural network-based scheme outperforms 33%, and convolutional neural network-based scheme outperforms 25% compared to the baseline scheme.
Keyword:
Mobile edge computing
deep learning
proactive caching
prediction model searching
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

U
University of Sydney
学者数:
6.5W
论文数: 6.2W
被引数: 90
K
kyung hee university
学者数:
2.3W
论文数: 2.2W
被引数: 234