Dynamic proactive caching in relay networks
Dynamic proactive caching in relay networks
复制标题
中继网络中的动态主动缓存
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
F. Digham
中科院分区：
文献类型：
--
作者：
Rana A. Hassan;A. Mohamed;John Tadrous;M. Nafie;T. Elbatt;F. Digham
我们研究了中继网络中的动态主动缓存的性能，其中中间中继站缓存内容供最终用户将来使用。中央基站主动地控制该高速缓存分配，使得缓存的内容在被称为主动服务窗口的有限数量的时隙内保持新鲜以供消费。在多个数据项和动态变化的无线链路上具有不确定的用户需求的情况下，我们考虑中继站缓存的最优分配，以最小化时间平均期望服务成本。我们的特点是一个基本的下限实现任何主动缓存策略的成本。然后，我们开发了一个渐近最优的缓存策略，达到了主动缓存窗口大小的增长的下限。我们的分析结果与数值模拟的支持，以证明建议的中继缓存的效率。
We investigate the performance of dynamic proactive caching in relay networks where an intermediate relay station caches content for potential future use by end users. A central base station proactively controls the cache allocation such that cached content remains fresh for consumption for a limited number of time slots called proactive service window. With uncertain user demand over multiple data items and dynamically changing wireless links, we consider the optimal allocation of relay stations cache to minimize the time average expected service cost. We characterize a fundamental lower bound on the cost achieved by any proactive caching policy. Then we develop an asymptotically optimal caching policy that attains the lower bound as the proactive caching window size grows. Our analytical findings are supported with numerical simulations to demonstrate the efficiency of the proposed relay-caching.