论文标题

用异质用户配置文件编码的缓存

Coded Caching with Heterogeneous User Profiles

论文作者

Zhang, Ciyuan, Wang, Su, Aggarwal, Vaneet, Peleato, Borja

论文摘要

编码的缓存利用在非高峰时段进行预取,并进行多批量交付,以平衡通信网络中的流量负载。几项工作研究了在不同条件下可实现的峰值和平均速率:可变的文件长度或受欢迎程度,可变的高速缓存大小,分散的网络等。但是,尽管现代内容提供商正在大量投资于他们的习惯和偏好。 本文提出了三个编码的缓存方案,并针对将最终用户分组为具有不同文件需求集(FDS)的类别的方案进行了未编码的预取。一种方案忽略了类之间的差异,另一个方案忽略了它们与第三类之间的交集,将所有FD的文件传递与单个类别的所有FD的传递。将三个方案的传输速率与下限进行比较,以评估其差距至最佳性,并且彼此表明,在满足某些条件时,每个方案都可以胜过其他两个方案。

Coded caching utilizes pre-fetching during off-peak hours and multi-casting for delivery in order to balance the traffic load in communication networks. Several works have studied the achievable peak and average rates under different conditions: variable file lengths or popularities, variable cache sizes, decentralized networks, etc. However, very few have considered the possibility of heterogeneous user profiles, despite modern content providers are investing heavily in categorizing users according to their habits and preferences. This paper proposes three coded caching schemes with uncoded pre-fetching for scenarios where end users are grouped into classes with different file demand sets (FDS). One scheme ignores the difference between the classes, another ignores the intersection between them and the third decouples the delivery of files common to all FDS from those unique to a single class. The transmission rates of the three schemes are compared with a lower bound to evaluate their gap to optimality, and with each other to show that each scheme can outperform the other two when certain conditions are met.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源