Coded Caching Under Arbitrary Popularity Distributions

Zhang, Jinbei; Lin, Xiaojun; Wang, Xinbing

doi:10.1109/tit.2017.2768517

Cited by 137 publications

(170 citation statements)

References 15 publications

Supporting

Mentioning

167

Contrasting

Order By: Relevance

“…Although we have characterized the expected NDT for F-RANs under uniform popularity distribution within a constant gap from the lower bound, it is still an open problem to characterize the expected NDT under arbitrary popularity distribution with caches at receivers. Although the proposed achievable scheme can be generalized for arbitrary popularity distribution, the problem remains challenging because it is hard to find a tight lower bound even in the case of a single transmitter [5]. Another important direction to extend our work is considering the case of coded placement, in which the transmitters and receivers are not restricted to store uncoded fragments of the library files.…”

Section: Discussionmentioning

confidence: 99%

“…where the constraint (30) comes from the total number of bits in the library. (31) is to maintain the total cache sizes at the transmitters 5 , while (32) is to maintain the total cache sizes at receivers.…”

Section: A Bound On the Ndt Of The Fronthaul Transmissionmentioning

confidence: 99%

“…However, in real systems, different contents might have different popularities, where several receivers might request the same content. Hence, the work in [3]- [5] studied the expected transmission rate for non-uniform popularity distribution instead of the peak transmission rate. In [6], the authors provided a full characterization of both the expected rate for uniform popularity distribution and the peak rate of the cache-aided, noiseless broadcast channel with uncoded placement.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Fundamental Limits of Memory-Latency Tradeoff in Fog Radio Access Networks Under Arbitrary Demands

Girgis

Erçetin

Nafie

et al. 2019

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

We consider a Fog Radio Access Network (F-RAN) with multiple of transmitters and receivers, where each transmitter is connected to the cloud via a fronthaul link. Each network node has a finite cache, where it fills its cache with portions of the library files in the off-peak hours. In the delivery phase, receivers request each library files according to an arbitrary popularity distribution. The cloud and the transmitters are responsible for satisfying the requests. This paper aims to design content placement and coded delivery schemes for minimizing both the expected normalized delivery time (NDT) and the peak NDT which measures the transmission latency. We propose achievable transmission policies, and derive an information-theoretic bound on the expected NDT under uniform popularity distribution. Analytical results show that the proposed scheme is within a gap of 2.58 from the derived bound for both the expected NDT under uniform popularity distribution and the peak NDT. Next, we investigate the expected NDT under an arbitrary popularity distribution for an F-RAN with transmitter-side caches only. The achievable and information-theoretic bounds on the expected NDT are derived, where we analytically prove that our proposed scheme is optimal within a gap of 2 independent of the popularity distribution.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: A Bound On the Ndt Of The Fronthaul Transmissionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fundamental Limits of Memory-Latency Tradeoff in Fog Radio Access Networks Under Arbitrary Demands

Girgis

Erçetin

Nafie

et al. 2019

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…We consider the case N = 10 files and K = 15 users. We provide the ratememory regions in [ 6]. We observe that, for the special situation considered here, the new proposed scheme obtains a significant improvement with respect to the previous best SOTA.…”

Section: Corollary 11 For a Caching Problem With K Users And N Filementioning

confidence: 99%

Fundamental limits of caching: Improved rate-memory trade-off with coded prefetching

Gómez-Vilardebó

2018

IEEE Trans. Commun.

View full text Add to dashboard Cite

We consider a cache network in which a single server is connected to multiple users via a shared error free link. The server has access to a database with N files of equal length F , and serves K users each with a cache memory of M F bits. A novel centralized coded caching scheme is proposed for scenarios with more users than files N ≤ K and cache capacities satisfying 1 K ≤ M ≤ N K. The proposed scheme outperforms the best ratememory region known in the literature if N ≤ K ≤ N 2 +1 2. Index Terms-Coded caching, network coding, index coding.

show abstract

“…The rate-memory tradeoff of multi-layer coded caching networks is studied in [11], [12]. The authors in [13], [14] derive an information-theoretic lower bound on the expected transmission rate for arbitrary content popularity. It is worth noting that the benefit of coded caching comes at a price of coordination since the data centre needs to know the number of users in order to construct the coded messages.…”

Section: Introductionmentioning

confidence: 99%

Energy Efficient Design for Coded Caching Delivery Phase

Lei

Chatzinotas

et al. 2019

2019 3rd International Conference on Recent Advances in Signal Processing, Telecommunications &Amp; Computing (SigTelCom)

View full text Add to dashboard Cite

Edge-caching is a promising technique to improve the network performance in terms of delivery latency and network congestion during peak-traffic times. Between the two fundamental methods, coded caching has received much attention due to its significant gain over the uncoded counterpart. In this paper, we propose an energy-efficient beamforming design for coded caching delivery phase in wireless networks context. In particular, by exploiting the broadcasting capability of the wireless channels and taking into the cache size, a multi-group multicast based transmission scheme is employed to deliver multiple coded messages to different subgroups of users simultaneously. Numerical results show a significant energy consumption reduction of the proposed design compared to the conventional scheme in the small and medium cache size regime.

show abstract

Coded Caching Under Arbitrary Popularity Distributions

Cited by 137 publications

References 15 publications

Fundamental Limits of Memory-Latency Tradeoff in Fog Radio Access Networks Under Arbitrary Demands

Fundamental Limits of Memory-Latency Tradeoff in Fog Radio Access Networks Under Arbitrary Demands

Fundamental limits of caching: Improved rate-memory trade-off with coded prefetching

Energy Efficient Design for Coded Caching Delivery Phase

Contact Info

Product

Resources

About