具有覆盖重叠的无线网络中的空间多LRU缓存
Spatial multi-LRU Caching for Wireless Networks with Coverage Overlaps
摘要：
本文介绍了一种新的家庭分散的缓存政策，适用于无线网络的边缘节点（站）有限的存储。这些策略基于最近最少使用的替换原则，并且在这里被称为空间多LRU。基于这些，以向被多于一个站覆盖并因此能够访问多于一个站的用户提供内容多样性的方式更新高速缓存库存。提出了两种变化，即多LRU-一个和-所有，这在涉及的缓存中插入的副本的数量不同。通过引入空间近似，我们提出了一种类似于Che的方法来预测命中概率，该方法在独立参考模型下给出了非常准确的结果。结果表明，多LRU的性能增加更多的多覆盖区域的增加，它的性能接近其他建议的集中式政策，当多覆盖是足够的。对于非线性业务，multi-LRU-One的性能优于multi-LRU-All，而当业务表现出时间局部性时，-All的变化可以表现得更好。
英文摘要：
This article introduces a novel family of decentralised caching policies, applicable to wireless networks with finite storage at the edge-nodes (stations). These policies are based on the Least-Recently-Used replacement principle, and are, here, referred to as spatial multi-LRU. Based on these, cache inventories are updated in a way that provides content diversity to users who are covered by, and thus have access to, more than one station. Two variations are proposed, namely the multi-LRU-One and -All, which differ in the number of replicas inserted in the involved caches. By introducing spatial approximations, we propose a Che-like method to predict the hit probability, which gives very accurate results under the Independent Reference Model (IRM). It is shown that the performance of multi-LRU increases the more the multi-coverage areas increase, and it approaches the performance of other proposed centralised policies, when multi-coverage is sufficient. For IRM traffic multi-LRU-One outperforms multi-LRU-All, whereas when the traffic exhibits temporal locality the -All variation can perform better.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
