深度学习用于具有未知和时变内容流行度的无线编码缓存
Deep Learning for Wireless Coded Caching with Unknown and Time-Variant Content Popularity
摘要:
编码缓存通过将每个文件的不同编码段分布在多个缓存节点中来有效地利用无线网络中的累积存储大小。本文旨在找到一种无线编码缓存策略,以最小化总折扣网络成本,其中包括传输延迟和缓存更换成本,使用深度学习工具。由于未知的、时变的内容流行度以及连续的、高维的动作空间,该问题是具有挑战性的。首先,我们提出了一个基于聚类的长短期记忆(C-LTSM)的方法来预测内容请求的数量使用历史请求信息。该方法通过聚类利用不同文件之间的历史请求信息的相关性。基于预测结果,我们提出了一种监督的深度确定性策略梯度(SDDPG)方法。这种方法,一方面,可以学习缓存策略在连续的动作空间,通过使用ACTOR-CRITIC架构。另一方面,它通过基于最小化每个时隙成本的近似问题的解决方案预训练演员网络来加速学习过程。真实世界的基于跟踪的数值结果表明,使用深度学习的预测和缓存策略优于考虑的现有方法。
英文摘要:
Coded caching is effective in leveraging the accumulated storage size in wireless networks by distributing different coded segments of each file in multiple cache nodes. This paper aims to find a wireless coded caching policy to minimize the total discounted network cost, which involves both transmission delay and cache replacement cost, using tools from deep learning. The problem is known to be challenging due to the unknown, time-variant content popularity as well as the continuous, high-dimensional action space. We first propose a clustering based long short-term memory (C-LTSM) approach to predict the number of content requests using historical request information. This approach exploits the correlation of the historical request information between different files through clustering. Based on the predicted results, we then propose a supervised deep deterministic policy gradient (SDDPG) approach. This approach, on one hand, can learn the caching policy in continuous action space by using the actor-critic architecture. On the other hand, it accelerates the learning process by pre-training the actor network based on the solution of an approximate problem that minimizes the per-slot cost. Real-world trace-based numerical results show that the proposed prediction and caching policy using deep learning outperform the considered existing methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。