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

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

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

Abstract

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
DOIs
StatePublished - Feb 7 2017
Event37th IEEE Sarnoff Symposium, Sarnoff 2016 - Newark, United States
Duration: Sep 19 2016Sep 21 2016

Other

Other37th IEEE Sarnoff Symposium, Sarnoff 2016
CountryUnited States
CityNewark
Period9/19/169/21/16

Fingerprint

Data storage equipment

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Hassanzadeh, P., Tulino, A., Llorca, J., & Erkip, E. (2017). Memory-rate trade-off for caching and delivery of correlated sources. In 37th IEEE Sarnoff Symposium, Sarnoff 2016 [7846729] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SARNOF.2016.7846729

Memory-rate trade-off for caching and delivery of correlated sources. / Hassanzadeh, P.; Tulino, A.; Llorca, J.; Erkip, Elza.

37th IEEE Sarnoff Symposium, Sarnoff 2016. Institute of Electrical and Electronics Engineers Inc., 2017. 7846729.

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

Hassanzadeh, P, Tulino, A, Llorca, J & Erkip, E 2017, Memory-rate trade-off for caching and delivery of correlated sources. in 37th IEEE Sarnoff Symposium, Sarnoff 2016., 7846729, Institute of Electrical and Electronics Engineers Inc., 37th IEEE Sarnoff Symposium, Sarnoff 2016, Newark, United States, 9/19/16. https://doi.org/10.1109/SARNOF.2016.7846729
Hassanzadeh P, Tulino A, Llorca J, Erkip E. Memory-rate trade-off for caching and delivery of correlated sources. In 37th IEEE Sarnoff Symposium, Sarnoff 2016. Institute of Electrical and Electronics Engineers Inc. 2017. 7846729 https://doi.org/10.1109/SARNOF.2016.7846729
Hassanzadeh, P. ; Tulino, A. ; Llorca, J. ; Erkip, Elza. / Memory-rate trade-off for caching and delivery of correlated sources. 37th IEEE Sarnoff Symposium, Sarnoff 2016. Institute of Electrical and Electronics Engineers Inc., 2017.
@inproceedings{70d77b039ee84eb89db70e3c5bd28543,
title = "Memory-rate trade-off for caching and delivery of correlated sources",
abstract = "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.",
author = "P. Hassanzadeh and A. Tulino and J. Llorca and Elza Erkip",
year = "2017",
month = "2",
day = "7",
doi = "10.1109/SARNOF.2016.7846729",
language = "English (US)",
booktitle = "37th IEEE Sarnoff Symposium, Sarnoff 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

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

AU - Hassanzadeh, P.

AU - Tulino, A.

AU - Llorca, J.

AU - Erkip, Elza

PY - 2017/2/7

Y1 - 2017/2/7

N2 - 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.

AB - 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.

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

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

U2 - 10.1109/SARNOF.2016.7846729

DO - 10.1109/SARNOF.2016.7846729

M3 - Conference contribution

BT - 37th IEEE Sarnoff Symposium, Sarnoff 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -