The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Content Popularity Prediction Towards Location-Aware Mobile Edge Caching
Open accessAbstract
Mobile edge caching aims to enable content delivery within the radio access network, which effectively alleviates the backhaul burden and reduces response time. To fully exploit edge storage resources, the most popular contents should be identified and cached. Observing that user demands on certain contents vary greatly at different locations, this paper devises location-customized caching schemes to maximize the total content hit rate. Specifically, a linear model is used to estimate the future content hit rate. For the case with zero-mean noise, a ridge regression-based online algorithm with positive perturbation is proposed. Regret analysis indicates that the hit rate achieved by the proposed algorithm asymptotically approaches that of the optimal caching strategy in the long run. When the noise structure is unknown, an$H_{\infty }$filter-based online algorithm is devised by taking a prescribed threshold as input, which guarantees prediction accuracy even under the worst-case noise process. Both online algorithms require no training phases and, hence, are robust to the time-varying user demands. The estimation errors of both algorithms are numerically analyzed. Moreover, extensive experiments using real-world datasets are conducted to validate the applicability of the proposed algorithms. It is demonstrated that those algorithms can be applied to scenarios with different noise features, and are able to make adaptive caching decisions, achieving a content hit rate that is comparable to that via the hindsight optimal strategy.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
Optimal State Estimation: Kalman, H∞, and Nonlinear Approaches
Simon, D. (2006) · doi:10.1002/0470045345 · Cited by 4,875
Cache in the air: exploiting content caching and delivery techniques for 5G systems
Wang, X., Chen, M., Taleb, T., Ksentini, A., & Leung, V. (2014) · IEEE Communications Magazine · doi:10.1109/mcom.2014.6736753 · Cited by 1,063
Cited by
Delay-Aware Microservice Coordination in Mobile Edge Computing: A Reinforcement Learning Approach
Wang, S., Guo, Y., Zhang, N., Yang, P., Zhou, A., & Shen, X. (2021) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2019.2957804 · Cited by 463
Self-citationAI-Assisted Network-Slicing Based Next-Generation Wireless Networks
Shen, X., Gao, J., Wu, W., Lyu, K., Li, M., Zhuang, W., Li, X., & Rao, J. (2020) · IEEE Open Journal of Vehicular Technology · doi:10.1109/ojvt.2020.2965100 · Cited by 342
Self-citationSDN/NFV-Empowered Future IoV With Enhanced Communication, Computing, and Caching
Zhuang, W., Ye, Q., Lyu, F., Cheng, N., & Ren, J. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2951169 · Cited by 301
Privacy-aware service placement for mobile edge computing via federated learning
Qian, Y., Hu, L., Chen, J., Guan, X., Hassan, M. M., & Alelaiwi, A. (2019) · Information Sciences · doi:10.1016/j.ins.2019.07.069 · Cited by 122
Metadata
- Authors
- Yang, P., Zhang, N., Zhang, S., Yu, L., Zhang, J., & Shen, X.
- Venue
- IEEE Transactions on Multimedia
- Published
- 2019-04
- Volume
- 21
- Issue
- 4
- Pages
- 915-929
- ISSN
- 1520-9210 (ISSN-L)
- 1941-0077
- OpenAlex
- W2891286892
- Cited by
- 199
- References
- 3
- FWCI
- 18.83
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Content Popularity Prediction Towards Location-Aware Mobile Edge Caching. https://app.cochat.ai/papers/10.1109/tmm.2018.2870521
- The paper
- Yang, P., Zhang, N., Zhang, S., Yu, L., Zhang, J., & Shen, X. (2019). Content Popularity Prediction Towards Location-Aware Mobile Edge Caching. IEEE Transactions on Multimedia. https://doi.org/10.1109/tmm.2018.2870521
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.