On Coding for Cache-Aided Delivery of Dynamic Correlated Content

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

doi:10.1109/jsac.2018.2844579

Cited by 19 publications

(8 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Caching strategies can be categorized into uncoded techniques [98]- [100] and coded techniques [101]- [103] based on the stored content type. In the uncoded technique, the whole file or a fractional portion of the file is stored in the caching node.…”

Section: Caching Strategiesmentioning

confidence: 99%

A Review on Green Caching Strategies for Next Generation Communication Networks

et al. 2020

View full text Add to dashboard Cite

In recent years, the ever-increasing demand for networking resources and energy, fueled by the unprecedented upsurge in Internet traffic, has been a cause for concern for many service providers. Content caching, which serves user requests locally, is deemed to be an enabling technology in addressing the challenges offered by the phenomenal growth in Internet traffic. Conventionally, content caching is considered as a viable solution to alleviate the backhaul pressure. However, recently, many studies have reported energy cost reductions contributed by content caching in cache-equipped networks. The hypothesis is that caching shortens content delivery distance and eventually achieves significant reduction in transmission energy consumption. This has motivated us to conduct this study and in this article, a comprehensive survey of the state-of-the-art green caching techniques is provided. This review paper extensively discusses contributions of the existing studies on green caching. In addition, the study explores different cache-equipped network types, solution methods, and application scenarios. We categorically present that the optimal selection of the caching nodes, smart resource management, popular content selection, and renewable energy integration can substantially improve energy efficiency of the cache-equipped systems. In addition, based on the comprehensive analysis, we also highlight some potential research ideas relevant to green content caching.

show abstract

Section: Caching Strategiesmentioning

confidence: 99%

A Review on Green Caching Strategies for Next Generation Communication Networks

et al. 2020

View full text Add to dashboard Cite

show abstract

“…The issue of caching for non-uniform file preferences has been considered starting with [13], where bounds are derived for a multi-user scenario in a worst-case sense with lossless file reconstruction, and in [14], where an order-optimal scheme is given under the same model. The issue of caching for correlated files has been considered in the lossless case in [15], [16], in the setting of lossless file reconstruction. Furthermore, some studies simultaneous to ours have also considered Gaussian models of files.…”

Section: B Related Literaturementioning

confidence: 99%

Caching (Bivariate) Gaussians

Veld

Gastpar

2020

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Caching is a technique that alleviates networks during peak hours by transmitting partial information before a request for any is made. In a lossy setting of Gaussian databases, we study a single-user model in which good caching strategies minimize the data still needed on average once the user requests a file. The encoder decides on a caching strategy by weighing the benefit from two key parameters: the prior preference for a file and the correlation among the files. Considering uniform prior preference but correlated files, caching becomes an application of Wyner's common information and Watanabe's total correlation. We show this case triggers a split: caching Gaussian sources is a non-convex optimization problem unless one spends enough rate to cache all the common information between files. Combining both correlation and user preference we explicitly characterize the full trade-off when the encoder uses Gaussian codebooks in a database of two files: we show that as the size of the cache increases, the encoder should change strategy and increasingly prioritize user preference over correlation. In this specific case we also address the loss in performance incurred if the encoder has no knowledge of the user's preference and show that this loss is bounded.

show abstract

“…Exploiting correlations to improve efficiency in distributed storage and caching settings has been of significant interest [24]- [30]. In [24] and [25], coding schemes were developed that use as input, the old and the new version of the data, and output a code that can be used to store both versions efficiently.…”

Section: Related Workmentioning

confidence: 99%

Harnessing Correlations in Distributed Erasure-Coded Key-Value Stores

Ali

Cadambe

2019

IEEE Trans. Commun.

View full text Add to dashboard Cite

Motivated by applications of distributed storage systems to key-value stores, the multi-version coding problem was formulated to efficiently store frequently updated data in asynchronous decentralized storage systems. Inspired by consistency requirements in distributed systems, the main goal in the multiversion coding problem is to ensure that the latest possible version of the data is decodable, even if the data updates have not reached some servers in the system. In this paper, we study the storage cost of ensuring consistency for the case where the data versions are correlated, in contrast to previous work where data versions were treated as being independent. We provide multi-version code constructions that show that the storage cost can be significantly smaller than the previous constructions depending on the degree of correlation, despite the asynchrony and the decentralized nature. Our achievability results are based on Reed-Solomon codes and random binning. Through an information-theoretic converse, we show that our multi-version codes are nearly-optimal, within a factor of 2, in certain interesting regimes. A read-write key-value store is a shared database that supports get or read operations, and put or write operations.

show abstract

On Coding for Cache-Aided Delivery of Dynamic Correlated Content

Cited by 19 publications

References 25 publications

A Review on Green Caching Strategies for Next Generation Communication Networks

A Review on Green Caching Strategies for Next Generation Communication Networks

Caching (Bivariate) Gaussians

Harnessing Correlations in Distributed Erasure-Coded Key-Value Stores

Contact Info

Product

Resources

About