Efficient File Delivery for Coded Prefetching in Shared Cache Networks with Multiple Requests Per User

Xu, Haisheng; Chen, Gong; Wang, Xiaodong

doi:10.48550/arxiv.1803.09408

Cited by 1 publication

(4 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It can be seen that our proposed scheme with this 12-way partition achieves a lower load than the scheme in [26] when M ≥ 24. Moreover, the subpacketization level with our scheme is in general lower that that of [26]; for example, when M = N/2 = 180, the subpacketization levels of the scheme in [26] and of the proposed scheme with the 12-way partition are 30 15 ≈ 1.55 × 10 8 and 12 6 = 924, respectively, that is, a five order of magnitude difference.…”

Section: Numerical Evaluationsmentioning

confidence: 83%

“…When K mbs = 0 (i.e., there are no users directly connected to the MBS) and there is no sidelink communication among the SBSs, we obtain the single bottleneck-link coded caching problem with shared caches, or with users making multiple requests [26]- [30]. When K sbs = H, K mbs = 0 and the MBS load is equal to 0, our model reduces to the D2D coded caching problem [5].…”

Section: A Brief Description Of the Proposed Fog-ran Modelmentioning

confidence: 99%

“…Moving to coded placement strategies, it is worthwhile to remark that a caching scheme based on an inter-file coded cache placement was proposed in [30] for HM ∈ [1, N], to improve the caching scheme in [26] for small memory size regime but without any optimality guarantees.…”

Section: B Relatedmentioning

confidence: 99%

“…as the collection of all transmitted signals. Note that we do not indicate the dependance on d in (30) and in (31) so as not to clutter the notation.…”

Section: B Proof Of (8b)mentioning

confidence: 99%

See 3 more Smart Citations

On the Fundamental Limits of Fog-RAN Cache-aided Networks with Downlink and Sidelink Communications

Wan¹,

Tuninetti²,

Ji³

et al. 2018

Preprint

View full text Add to dashboard Cite

Maddah-Ali and Niesen (MAN) in 2014 showed that coded caching in single bottleneck-link broadcast networks allows serving an arbitrarily large number of cache-equipped users with a total link load (bits per unit time) that does not scale with the number of users. Since then, the general topic of coded caching has generated enormous interest both from the information theoretic and (network) coding theoretic viewpoint, and from the viewpoint of applications. Building on the MAN work, this paper considers a particular network topology referred to as cache-aided Fog Radio Access Network (Fog-RAN), that includes a Macro-cell Base Station (MBS) co-located with the content server, several cache-equipped Small-cell Base Stations (SBSs), and many users without caches. Some users are served directly by the MBS broadcast downlink, while other users are served by the SBSs. The SBSs can also exchange data via rounds of direct communication via a side channel, referred to as "sidelink". For this novel Fog-RAN model, the fundamental tradeoff among (a) the amount of cache memory at the SBSs, (b) the load on the downlink (from MBS to directly served users and SBSs), and (c) the aggregate load on the sidelink is studied, under the standard worst-case demand scenario. Several existing results are recovered as special cases of this network model and byproduct results of independent interest are given. Finally, the role of topology-aware versus topology-agnostic caching is discussed.

show abstract

Section: Numerical Evaluationsmentioning

confidence: 83%

Section: A Brief Description Of the Proposed Fog-ran Modelmentioning

confidence: 99%

Section: B Relatedmentioning

confidence: 99%

“…as the collection of all transmitted signals. Note that we do not indicate the dependance on d in (30) and in (31) so as not to clutter the notation.…”

Section: B Proof Of (8b)mentioning

confidence: 99%

See 2 more Smart Citations