An Index Coding Approach to Caching With Uncoded Cache Placement

Wan, Kai; Tuninetti, Daniela; Piantanida, Pablo

doi:10.1109/tit.2020.2967753

Cited by 103 publications

(103 citation statements)

References 44 publications

Supporting

Mentioning

102

Contrasting

Order By: Relevance

“…Such a scheme is referred to as the MN scheme in this paper. In [21], using graph theory the authors showed that when K ≤ N the MN scheme has minimum transmission rate under uncoded placement. Hence the MN scheme has also been widely used in various networks [1], [6]- [8], [10]- [13].…”

Section: B Prior Workmentioning

confidence: 99%

Linear Coded Caching Scheme for Centralized Networks

Cheng

Tang

et al. 2021

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Coded caching systems have been widely studied to reduce the data transmission during the peak traffic time. In practice, two important parameters of a coded caching system should be considered, i.e., the transmission rate which is the maximum amount of the data transmission during the peak traffic time, and the subpacketization level, the number of divided packets of each file when we implement a coded caching scheme. Although there exists a tradeoff between transmission rate and subpacketization, we prefer to design a scheme with transmission rate and subpacketization as small as possible since they reflect the transmission efficiency and complexity of the caching scheme, respectively. In this paper, we first characterize a coded caching scheme from the viewpoint of linear algebra and show that designing a linear coded caching scheme is equivalent to constructing three classes of matrices satisfying some rank conditions. Then based on the invariant subspaces in linear algebra and combinatorial design theory, a new class of coded caching schemes over F2 is obtained by constructing these three classes of matrices. It turns out that the transmission rate of our new scheme is the same as the scheme construct by Yan et al. (IEEE Trans. Inf. Theory 63, 5821-5833, 2017), but the subpacketization is significantly reduced. Finally by means of these matrices, we show that the minimum storage regenerating codes can also be used to construct coded caching schemes.

show abstract

Section: B Prior Workmentioning

confidence: 99%

Linear Coded Caching Scheme for Centralized Networks

Cheng

Tang

et al. 2021

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…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

“…The proof of Theorem 2 utilizes Lemma 2 in [9] which is based on the approaches in [3], [12] and provides a lower bound on the entropy of all transmissions in the Shuffle phase given a specific function and file placement and a permutation of the computing nodes.…”

Section: Appendix C Proof Of Theoremmentioning

confidence: 99%

Cascaded Coded Distributed Computing on Heterogeneous Networks

Woolsey

Chen

2019

2019 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

Coded distributed computing (CDC) introduced by Li et al. in 2015 offers an efficient approach to trade computing power to reduce the communication load in general distributed computing frameworks such as MapReduce. For the more general cascaded CDC, Map computations are repeated at r nodes to significantly reduce the communication load among nodes tasked with computing Q Reduce functions s times. While an achievable cascaded CDC scheme was proposed, it only operates on homogeneous networks, where the storage, computation load and communication load of each computing node is the same. In this paper, we address this limitation by proposing a novel combinatorial design which operates on heterogeneous networks where nodes have varying storage and computing capabilities. We provide an analytical characterization of the computationcommunication trade-off and show that it is optimal within a constant factor and could outperform the state-of-the-art homogeneous schemes.

show abstract

An Index Coding Approach to Caching With Uncoded Cache Placement

Cited by 103 publications

References 44 publications

Linear Coded Caching Scheme for Centralized Networks

Linear Coded Caching Scheme for Centralized Networks

A Review on Green Caching Strategies for Next Generation Communication Networks

Cascaded Coded Distributed Computing on Heterogeneous Networks

Contact Info

Product

Resources

About