On Coding for Cache-Aided Delivery of Dynamic Correlated Content

Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip

Research output: Contribution to journalArticle

Abstract

Cache-aided coded multicast leverages side information at wireless edge caches to efficiently serve multiple unicast demands via common multicast transmissions, leading to load reductions that are proportional to the aggregate cache size. However, the increasingly dynamic, unpredictable, and personalized nature of the content that users consume challenges the efficiency of existing caching-based solutions in which only exact content reuse is explored. This paper generalizes the cache-aided coded multicast problem to specifically account for the correlation among content files, such as, for example, the one between updated versions of dynamic data. It is shown that (i) caching content pieces based on their correlation with the rest of the library, and (ii) jointly compressing requested files using cached information as references during delivery, can provide load reductions that go beyond those achieved with existing schemes. This is accomplished via the design of a class of correlation-aware achievable schemes, shown to significantly outperform state-of-the-art correlation-unaware solutions. Our results show that as we move towards realtime and/or personalized media dominated services, where exact cache hits are almost non-existent but updates can exhibit high levels of correlation, network cached information can still be useful as references for network compression.

Original languageEnglish (US)
JournalIEEE Journal on Selected Areas in Communications
DOIs
StateAccepted/In press - Jun 6 2018

Keywords

  • Coded Caching
  • Coded Multicasting
  • Content Distribution
  • Correlated Library
  • Dynamic Data
  • Index Coding
  • Network Coding
  • Network Compression

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

On Coding for Cache-Aided Delivery of Dynamic Correlated Content. / Hassanzadeh, Parisa; Tulino, Antonia M.; Llorca, Jaime; Erkip, Elza.

In: IEEE Journal on Selected Areas in Communications, 06.06.2018.

Research output: Contribution to journalArticle

@article{b9f7cb3f7b6e45b48bfad221bac12440,
title = "On Coding for Cache-Aided Delivery of Dynamic Correlated Content",
abstract = "Cache-aided coded multicast leverages side information at wireless edge caches to efficiently serve multiple unicast demands via common multicast transmissions, leading to load reductions that are proportional to the aggregate cache size. However, the increasingly dynamic, unpredictable, and personalized nature of the content that users consume challenges the efficiency of existing caching-based solutions in which only exact content reuse is explored. This paper generalizes the cache-aided coded multicast problem to specifically account for the correlation among content files, such as, for example, the one between updated versions of dynamic data. It is shown that (i) caching content pieces based on their correlation with the rest of the library, and (ii) jointly compressing requested files using cached information as references during delivery, can provide load reductions that go beyond those achieved with existing schemes. This is accomplished via the design of a class of correlation-aware achievable schemes, shown to significantly outperform state-of-the-art correlation-unaware solutions. Our results show that as we move towards realtime and/or personalized media dominated services, where exact cache hits are almost non-existent but updates can exhibit high levels of correlation, network cached information can still be useful as references for network compression.",
keywords = "Coded Caching, Coded Multicasting, Content Distribution, Correlated Library, Dynamic Data, Index Coding, Network Coding, Network Compression",
author = "Parisa Hassanzadeh and Tulino, {Antonia M.} and Jaime Llorca and Elza Erkip",
year = "2018",
month = "6",
day = "6",
doi = "10.1109/JSAC.2018.2844579",
language = "English (US)",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - On Coding for Cache-Aided Delivery of Dynamic Correlated Content

AU - Hassanzadeh, Parisa

AU - Tulino, Antonia M.

AU - Llorca, Jaime

AU - Erkip, Elza

PY - 2018/6/6

Y1 - 2018/6/6

N2 - Cache-aided coded multicast leverages side information at wireless edge caches to efficiently serve multiple unicast demands via common multicast transmissions, leading to load reductions that are proportional to the aggregate cache size. However, the increasingly dynamic, unpredictable, and personalized nature of the content that users consume challenges the efficiency of existing caching-based solutions in which only exact content reuse is explored. This paper generalizes the cache-aided coded multicast problem to specifically account for the correlation among content files, such as, for example, the one between updated versions of dynamic data. It is shown that (i) caching content pieces based on their correlation with the rest of the library, and (ii) jointly compressing requested files using cached information as references during delivery, can provide load reductions that go beyond those achieved with existing schemes. This is accomplished via the design of a class of correlation-aware achievable schemes, shown to significantly outperform state-of-the-art correlation-unaware solutions. Our results show that as we move towards realtime and/or personalized media dominated services, where exact cache hits are almost non-existent but updates can exhibit high levels of correlation, network cached information can still be useful as references for network compression.

AB - Cache-aided coded multicast leverages side information at wireless edge caches to efficiently serve multiple unicast demands via common multicast transmissions, leading to load reductions that are proportional to the aggregate cache size. However, the increasingly dynamic, unpredictable, and personalized nature of the content that users consume challenges the efficiency of existing caching-based solutions in which only exact content reuse is explored. This paper generalizes the cache-aided coded multicast problem to specifically account for the correlation among content files, such as, for example, the one between updated versions of dynamic data. It is shown that (i) caching content pieces based on their correlation with the rest of the library, and (ii) jointly compressing requested files using cached information as references during delivery, can provide load reductions that go beyond those achieved with existing schemes. This is accomplished via the design of a class of correlation-aware achievable schemes, shown to significantly outperform state-of-the-art correlation-unaware solutions. Our results show that as we move towards realtime and/or personalized media dominated services, where exact cache hits are almost non-existent but updates can exhibit high levels of correlation, network cached information can still be useful as references for network compression.

KW - Coded Caching

KW - Coded Multicasting

KW - Content Distribution

KW - Correlated Library

KW - Dynamic Data

KW - Index Coding

KW - Network Coding

KW - Network Compression

UR - http://www.scopus.com/inward/record.url?scp=85048203489&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85048203489&partnerID=8YFLogxK

U2 - 10.1109/JSAC.2018.2844579

DO - 10.1109/JSAC.2018.2844579

M3 - Article

AN - SCOPUS:85048203489

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

ER -