Pith. sign in

REVIEW

Delay-Aware Coded Caching for Mobile Users

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1807.02548 v1 pith:YBTDWBEZ submitted 2018-07-06 cs.IT cs.MMeess.IVmath.IT

Delay-Aware Coded Caching for Mobile Users

classification cs.IT cs.MMeess.IVmath.IT
keywords cachingcodeddelayaveragecachecapacityfilesmobile
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this work, we study the trade-off between the cache capacity and the user delay for a cooperative Small Base Station (SBS) coded caching system with mobile users. First, a delay-aware coded caching policy, which takes into account the popularity of the files and the maximum re-buffering delay to minimize the average rebuffering delay of a mobile user under a given cache capacity constraint is introduced. Subsequently, we address a scenario where some files are served by the macro-cell base station (MBS) when the cache capacity of the SBSs is not sufficient to store all the files in the library. For this scenario, we develop a coded caching policy that minimizes the average amount of data served by the MBS under an average re-buffering delay constraint.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.