Cited by 29Caching and Content DeliveryIoT and Edge/Fog ComputingSoftware-Defined Networks and 5G

The DOI matches its Crossref record; 16 of the 17 references it cites were found in a registry or an index.

Content Popularity Prediction in Fog Radio Access Networks: A Federated Learning Based Approach

Wu, Yuting, Jiang, Yanxiang, Bennis, Mehdi, Zheng, Fuchun, Gao, Xiqi, You, Xiaohu·2020·ICC 2020 - 2020 IEEE International Conference on Communications (ICC)

Abstract

In this paper, the content popularity prediction problem in fog radio access networks (F-RANs) is investigated. In order to obtain accurate prediction with low complexity, we propose a novel context-aware popularity prediction policy based on federated learning. Firstly, user preference learning is applied by considering that users prefer to request the contents they are interested in. Then, users' context information is utilized to cluster users efficiently by adaptive context space partitioning. After that, we formulate a popularity prediction optimization problem to learn the local model parameters using the stochastic variance reduced gradient (SVRG) algorithm. Finally, federated learning based model integration is proposed to construct the global popularity prediction model based on local models by combining the distributed approximate Newton (DANE) algorithm with SVRG. Our proposed popularity prediction policy not only predicts content popularity accurately, but also significantly reduces computational complexity. Simulation results show that our proposed policy increases the cache hit rate by up to 21.5 % compared to the traditional policies.

Overview

Integrity signals

Registry

Crossref · 10.1109/icc40277.2020.9148697

Cites

16 of 16 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • FL is a viable solution to estimate file popularity without disclosing sensitive user information.

    “FL comes as a viable solution to estimate the file popularity without disclosing sensitive user information and user preference.”
  • The popularity prediction of proactive edge caching mitigates traffic load and enhances user experience.

    “In fact, the popularity prediction of proactive edge caching at BSs can mitigate the traffic load and enhance user experience, by selecting the most popular and important contents in the offloaded data package.”

Citations

Cites

Flagged first, then by citations

1 of the 17 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Metadata

Authors
Wu, Y., Jiang, Y., Bennis, M., Zheng, F., Gao, X., & You, X.
Affiliations
  • Southeast University (CN)
  • University of Oulu (FI)
Venue
ICC 2020 - 2020 IEEE International Conference on Communications (ICC)
Publisher
IEEE
Published
2020-06
Pages
1-6
ISSN
1550-3607 (ISSN-L)
OpenAlex
W3046032603
Cited by
29
References
17
Citations by year
2026: 1 · 2025: 4 · 2024: 5 · 2023: 4 · 2022: 8 · 2021: 7
FWCI
3.98
Type
conference paper
Language
en
Open access
closed
Locations
International Conference on Communications (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Caching and Content Delivery
  • Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
  • Physical Sciences › Computer Science › Computer Networks and Communications › Software-Defined Networks and 5G
Keywords
content popularity prediction, fog radio access networks, federated learning, user preference learning, user clustering, SVRG, model integration, cache hit rate, edge caching

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