Memory-rate trade-off for caching and delivery of correlated sources

P. Hassanzadeh, A. Tulino, J. Llorca, E. Erkip

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


In cache-aided networks, due to the multicast nature of wireless signals, coded multicast delivery results in significant load reductions that are proportional to the aggregate cache size. State of the art caching schemes exploit exact content reuse across the network, which, due to the personalized nature of the content consumed by users, can lead to limited efficiency of the scheme. In this work, the cache-aided coded multicast setting is extended to specifically exploit the correlation among the content files. The load over the shared link is notably reduced by jointly compressing the content during the caching and delivery phases. Two classes of correlation-aware achievable schemes are proposed, both of which are shown to significantly outperform existing correlation-unaware solutions, while approaching the limiting rate-memory trade-off.

Original languageEnglish (US)
Title of host publication37th IEEE Sarnoff Symposium, Sarnoff 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509015405
StatePublished - Feb 7 2017
Event37th IEEE Sarnoff Symposium, Sarnoff 2016 - Newark, United States
Duration: Sep 19 2016Sep 21 2016

Publication series

Name37th IEEE Sarnoff Symposium, Sarnoff 2016


Other37th IEEE Sarnoff Symposium, Sarnoff 2016
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture


Dive into the research topics of 'Memory-rate trade-off for caching and delivery of correlated sources'. Together they form a unique fingerprint.

Cite this