Coded Caching under Non-Uniform Content Popularity Distributions with Multiple Requests

Abdollah Ghaffari Sheshjavani, Ahmad Khonsari, Seyed Pooya Shariatpanahi, Masoumeh Moradian, Aresh Dadlani

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publication2020 IEEE Wireless Communications and Networking Conference, WCNC 2020 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728131061
DOIs
Publication statusPublished - May 2020
Event2020 IEEE Wireless Communications and Networking Conference, WCNC 2020 - Seoul, Korea, Republic of
Duration: May 25 2020May 28 2020

Publication series

NameIEEE Wireless Communications and Networking Conference, WCNC
Volume2020-May
ISSN (Print)1525-3511

Conference

Conference2020 IEEE Wireless Communications and Networking Conference, WCNC 2020
CountryKorea, Republic of
CitySeoul
Period5/25/205/28/20

Keywords

  • arbitrary popularity distribution
  • cache content placement
  • Coded caching
  • multiple requests
  • optimization

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Coded Caching under Non-Uniform Content Popularity Distributions with Multiple Requests'. Together they form a unique fingerprint.

Cite this