Caching at the Edge with LT Codes

2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)(2018)

引用 2|浏览3
暂无评分
摘要
We study the performance of caching schemes based on LT under peeling (iterative) decoding algorithm. We assume that users ask for downloading content to multiple cache-aided transmitters. Transmitters are connected through a backhaul link to a master node while no direct link exists between users and the master node. Each content is fragmented and coded with LT code. Cache placement at each transmitter is optimized such that transmissions over the backhaul link is minimized. We derive a closed form expression for the calculation of the backhaul transmission rate. We compare the performance of a caching scheme based on LT with respect to a caching scheme based on maximum distance separable codes. Finally, we show that caching with LT codes behave as good as caching with maximum distance separable codes.
更多
查看译文
关键词
LT code,caching scheme,decoding algorithm,downloading content,multiple cache-aided transmitters,backhaul link,master node,direct link,cache placement,backhaul transmission rate,maximum distance separable codes
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要