.png){kind=icon}
返回
Probabilistic Caching Based on Maximum Distance Separable Code in a User-Centric Clustered Cache-Aided Wireless Network
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2019.2897298.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We investigate how the maximum-distance separable (MDS) coding can be incorporated into probabilistic caching to utilize the limited storage space efficiently. In a user-centric clustered wireless network, each caching helper node probabilistically caches a segment of MDS coded sequence of each file. The segment size is optimized to maximize the cache hit probability or successful file retrieval probability. We reveal that the best way of storing files is determined by the condition whether the average amount of MDS coded information stored for the requested file within a user's cluster exceeds the amount required for file retrieval or not. In terms of the cache hit probability maximization, if the condition is not fulfilled, it is proved that storing the complete file with a low probability is optimal. Otherwise, storing either a segment as small as possible with a high probability or a complete file with a low probability, according to a given environment, is shown to be desirable. We also analyze the successful retrieval probability, which accounts for both a cache hit event and successful transmissions from multiple caching helper nodes. Since the successful retrieval probability is in an intractable form, to find the desirable segment size, the theoretically driven algorithms with low search complexity are developed.
Keyword:
MDS coded caching
probabilistic caching
stochastic geometry
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
Optimal Storage Allocation for Wireless Cloud Caching Systems With a Limited Sum Storage Capacity
OAAI
OAAI分享收藏
查看更多内容