The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
User Preference Learning-Based Edge Caching for Fog Radio Access Network
Open accessAbstract
In this paper, the edge caching problem in fog radio access network (F-RAN) is investigated. By maximizing the overall cache hit rate, the edge caching optimization problem is formulated to find the optimal policy. Content popularity in terms of time and space is considered from the perspective of regional users. We propose an online content popularity prediction algorithm by leveraging the content features and user preferences, and an offline user preference learning algorithm by using the online gradient descent (OGD) method and the follow the (proximally) regularized leader (FTRL-Proximal) method. Our proposed edge caching policy not only can promptly predict the future content popularity in an online fashion with low complexity, but also can track the content popularity with spatial and temporal popularity dynamic in time without delay. Furthermore, we design two learning-based edge caching architectures. Moreover, we theoretically derive the upper bound of the popularity prediction error, the lower bound of the cache hit rate, and the regret bound of the overall cache hit rate of our proposed edge caching policy. Simulation results show that the overall cache hit rate of our proposed policy is superior to those of the traditional policies and asymptotically approaches the optimal performance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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 2×
“Traditional caching policies such as first in first out (FIFO) [6], least recently used (LRU) [7], least frequently used (LFU) [8] and their variants [9] have been widely applied in wired networks, where there are abundant caching and computing resources and the served area is usually very large.”
Background
Cited by
On the Road to 6G: Visions, Requirements, Key Technologies, and Testbeds
Wang, C.-X., You, X., Gao, X., Zhu, X., Li, Z., Zhang, C., Wang, H., Huang, Y., Chen, Y., Haas, H., et al. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3249835 · Cited by 2,336
Self-citationOnline Content Popularity Prediction and Learning in Wireless Edge Caching
Garg, N., Sellathurai, M., Bhatia, V., Bharath, B. N., & Ratnarajah, T. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2019.2956041 · Cited by 89
Yuan, L., He, Q., Tan, S., Li, B., Yu, J., Chen, F., & Yang, Y. (2023) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2022.3231296 · Cited by 33
Content Popularity Prediction in Fog Radio Access Networks: A Federated Learning Based Approach
Wu, Y., Jiang, Y., Bennis, M., Zheng, F., Gao, X., & You, X. (2020) · ICC 2020 - 2020 IEEE International Conference on Communications (ICC) · doi:10.1109/icc40277.2020.9148697 · Cited by 29
Self-citation
Metadata
- Authors
- Jiang, Y., Ma, M., Bennis, M., Zheng, F.-C., & You, X.
- Venue
- IEEE Transactions on Communications
- Published
- 2019-02
- Volume
- 67
- Issue
- 2
- Pages
- 1268-1283
- ISSN
- 0090-6778 (ISSN-L)
- 1558-0857
- OpenAlex
- W2900490252
- Cited by
- 180
- References
- 1
- FWCI
- 15.09
- 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: User Preference Learning-Based Edge Caching for Fog Radio Access Network. https://app.cochat.ai/papers/10.1109/tcomm.2018.2880482
- The paper
- Jiang, Y., Ma, M., Bennis, M., Zheng, F.-C., & You, X. (2019). User Preference Learning-Based Edge Caching for Fog Radio Access Network. IEEE Transactions on Communications. https://doi.org/10.1109/tcomm.2018.2880482
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.