TY - GEN
T1 - Coded Caching under Non-Uniform Content Popularity Distributions with Multiple Requests
AU - Sheshjavani, Abdollah Ghaffari
AU - Khonsari, Ahmad
AU - Shariatpanahi, Seyed Pooya
AU - Moradian, Masoumeh
AU - Dadlani, Aresh
N1 - Funding Information:
ACKNOWLEDGMENT This work was partially supported by the Social Policy Grant funded by Nazarbayev University, Kazakhstan.
Publisher Copyright:
© 2020 IEEE.
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2020/5
Y1 - 2020/5
N2 - Content caching is a technique aimed to reduce the network load imposed by data transmission during peak time while ensuring users' quality of experience. Studies have shown that content delivery via coded caching can significantly improve beyond the performance limits of conventional caching schemes when caches and the server share a common link. Finding the optimal cache content placement however, becomes challenging under arbitrary distributions of content popularity. While existing works show that partitioning contents into three popularity levels performs better when multiple requests are received at each time slot, they neither delve into the problem analysis nor derive closed-form expressions for the optimum partitioning problem. In this paper, we analyze the coded caching scheme for a system with arbitrary content popularity, where we derive explicit closed-forms for the server load in the delivery phase and formulate the near-optimum partitioning problem. Simulation results are presented to corroborate our mathematical analysis.
AB - Content caching is a technique aimed to reduce the network load imposed by data transmission during peak time while ensuring users' quality of experience. Studies have shown that content delivery via coded caching can significantly improve beyond the performance limits of conventional caching schemes when caches and the server share a common link. Finding the optimal cache content placement however, becomes challenging under arbitrary distributions of content popularity. While existing works show that partitioning contents into three popularity levels performs better when multiple requests are received at each time slot, they neither delve into the problem analysis nor derive closed-form expressions for the optimum partitioning problem. In this paper, we analyze the coded caching scheme for a system with arbitrary content popularity, where we derive explicit closed-forms for the server load in the delivery phase and formulate the near-optimum partitioning problem. Simulation results are presented to corroborate our mathematical analysis.
KW - arbitrary popularity distribution
KW - cache content placement
KW - Coded caching
KW - multiple requests
KW - optimization
UR - http://www.scopus.com/inward/record.url?scp=85087273621&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85087273621&partnerID=8YFLogxK
U2 - 10.1109/WCNC45663.2020.9120820
DO - 10.1109/WCNC45663.2020.9120820
M3 - Conference contribution
AN - SCOPUS:85087273621
T3 - IEEE Wireless Communications and Networking Conference, WCNC
BT - 2020 IEEE Wireless Communications and Networking Conference, WCNC 2020 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2020 IEEE Wireless Communications and Networking Conference, WCNC 2020
Y2 - 25 May 2020 through 28 May 2020
ER -