Correlation-aware distributed caching and coded delivery

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

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

Abstract

Cache-Aided coded multicast leverages side information at wireless edge caches to efficiently serve multiple groupcast demands via common multicast transmissions, leading to load reductions that are proportional to the aggregate cache size. However, the increasingly 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 a source compression with distributed side information problem that specifically accounts for the correlation among the content files. It is shown how joint file compression during the caching and delivery phases can provide load reductions that go beyond those achieved with existing schemes. This is accomplished through a lower bound on the fundamental rate-memory trade-off as well as a correlation-aware achievable scheme, shown to significantly outperform state-of-the-art correlation-unaware solutions, while approaching the limiting rate-memory trade-off.

Original languageEnglish (US)
Title of host publication2016 IEEE Information Theory Workshop, ITW 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages166-170
Number of pages5
ISBN (Electronic)9781509010905
DOIs
StatePublished - Oct 21 2016
Event2016 IEEE Information Theory Workshop, ITW 2016 - Cambridge, United Kingdom
Duration: Sep 11 2016Sep 14 2016

Other

Other2016 IEEE Information Theory Workshop, ITW 2016
CountryUnited Kingdom
CityCambridge
Period9/11/169/14/16

Fingerprint

Data storage equipment

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Software
  • Signal Processing

Cite this

Hassanzadeh, P., Tulino, A., Llorca, J., & Erkip, E. (2016). Correlation-aware distributed caching and coded delivery. In 2016 IEEE Information Theory Workshop, ITW 2016 (pp. 166-170). [7606817] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW.2016.7606817

Correlation-aware distributed caching and coded delivery. / Hassanzadeh, P.; Tulino, A.; Llorca, J.; Erkip, Elza.

2016 IEEE Information Theory Workshop, ITW 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 166-170 7606817.

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

Hassanzadeh, P, Tulino, A, Llorca, J & Erkip, E 2016, Correlation-aware distributed caching and coded delivery. in 2016 IEEE Information Theory Workshop, ITW 2016., 7606817, Institute of Electrical and Electronics Engineers Inc., pp. 166-170, 2016 IEEE Information Theory Workshop, ITW 2016, Cambridge, United Kingdom, 9/11/16. https://doi.org/10.1109/ITW.2016.7606817
Hassanzadeh P, Tulino A, Llorca J, Erkip E. Correlation-aware distributed caching and coded delivery. In 2016 IEEE Information Theory Workshop, ITW 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 166-170. 7606817 https://doi.org/10.1109/ITW.2016.7606817
Hassanzadeh, P. ; Tulino, A. ; Llorca, J. ; Erkip, Elza. / Correlation-aware distributed caching and coded delivery. 2016 IEEE Information Theory Workshop, ITW 2016. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 166-170
@inproceedings{e73813e164204fc59d0b124f2d5ae53e,
title = "Correlation-aware distributed caching and coded delivery",
abstract = "Cache-Aided coded multicast leverages side information at wireless edge caches to efficiently serve multiple groupcast demands via common multicast transmissions, leading to load reductions that are proportional to the aggregate cache size. However, the increasingly 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 a source compression with distributed side information problem that specifically accounts for the correlation among the content files. It is shown how joint file compression during the caching and delivery phases can provide load reductions that go beyond those achieved with existing schemes. This is accomplished through a lower bound on the fundamental rate-memory trade-off as well as a correlation-aware achievable scheme, shown to significantly outperform state-of-the-art correlation-unaware solutions, while approaching the limiting rate-memory trade-off.",
author = "P. Hassanzadeh and A. Tulino and J. Llorca and Elza Erkip",
year = "2016",
month = "10",
day = "21",
doi = "10.1109/ITW.2016.7606817",
language = "English (US)",
pages = "166--170",
booktitle = "2016 IEEE Information Theory Workshop, ITW 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Correlation-aware distributed caching and coded delivery

AU - Hassanzadeh, P.

AU - Tulino, A.

AU - Llorca, J.

AU - Erkip, Elza

PY - 2016/10/21

Y1 - 2016/10/21

N2 - Cache-Aided coded multicast leverages side information at wireless edge caches to efficiently serve multiple groupcast demands via common multicast transmissions, leading to load reductions that are proportional to the aggregate cache size. However, the increasingly 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 a source compression with distributed side information problem that specifically accounts for the correlation among the content files. It is shown how joint file compression during the caching and delivery phases can provide load reductions that go beyond those achieved with existing schemes. This is accomplished through a lower bound on the fundamental rate-memory trade-off as well as a correlation-aware achievable scheme, shown to significantly outperform state-of-the-art correlation-unaware solutions, while approaching the limiting rate-memory trade-off.

AB - Cache-Aided coded multicast leverages side information at wireless edge caches to efficiently serve multiple groupcast demands via common multicast transmissions, leading to load reductions that are proportional to the aggregate cache size. However, the increasingly 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 a source compression with distributed side information problem that specifically accounts for the correlation among the content files. It is shown how joint file compression during the caching and delivery phases can provide load reductions that go beyond those achieved with existing schemes. This is accomplished through a lower bound on the fundamental rate-memory trade-off as well as a correlation-aware achievable scheme, shown to significantly outperform state-of-the-art correlation-unaware solutions, while approaching the limiting rate-memory trade-off.

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

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

U2 - 10.1109/ITW.2016.7606817

DO - 10.1109/ITW.2016.7606817

M3 - Conference contribution

SP - 166

EP - 170

BT - 2016 IEEE Information Theory Workshop, ITW 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -