TY - GEN
T1 - Correlation-aware distributed caching and coded delivery
AU - Hassanzadeh, P.
AU - Tulino, A.
AU - Llorca, J.
AU - Erkip, E.
N1 - Publisher Copyright:
© 2016 IEEE.
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
AN - SCOPUS:84998854150
T3 - 2016 IEEE Information Theory Workshop, ITW 2016
SP - 166
EP - 170
BT - 2016 IEEE Information Theory Workshop, ITW 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE Information Theory Workshop, ITW 2016
Y2 - 11 September 2016 through 14 September 2016
ER -