Coded Caching With Heterogeneous User Profiles

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2024-03, Vol.70 (3), p.1836-1847
Main Authors: Zhang, Ciyuan, Wang, Su, Aggarwal, Vaneet, Peleato, Borja
Format: Article
Language:English
Subjects:
Caching
Coded caching
Communication networks
content distribution networks
End users
Lower bounds
Mathematical models
Multicast communication
peak and average rate
Peak hour traffic
Prefetching
Servers
Streaming media
User profiles
Wireless communication
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 similarities 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.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2022.3186210