Optimized Content Caching and User Association for Edge Computing in Densely Deployed Heterogeneous Networks
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Deploying small cell base stations (SBS) under the coverage area of a macro base station (MBS), and caching popular contents at the SBSs in advance, are effective means to provide high-speed and low-latency services in next generation mobile communication networks. In this paper, we investigate the problem of content caching (CC) and user association (UA) for edge computing. A joint CC and UA optimization problem is formulated to minimize the content download latency. We prove that the joint CC and UA optimization problem is NP-hard. Then, we propose a CC and UA algorithm (JCC-UA) to reduce the content download latency. JCC-UA includes a smart content caching policy (SCCP) and dynamic user association (DUA). SCCP utilizes the exponential smoothing method to predict content popularity and cache contents according to prediction results. DUA includes a rapid association (RA) method and a delayed association (DA) method. Simulation results demonstrate that the proposed JCC-UA algorithm can effectively reduce the latency of user content downloading and improve the hit rates of contents cached at the BSs as compared to several baseline schemes.
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
A Survey on Mobile Edge Computing: The Communication Perspective
Mao, Y., You, C., Zhang, J., Huang, K., & Letaief, K. B. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2745201 · Cited by 5,607
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 1×
“Distributed content caching technique is an emerging and effective means to solve this problem [5], [6], [7].”
BackgroundLearn to Cache: Machine Learning for Network Edge Caching in the Big Data Era
Chang, Z., Lei, L., Zhou, Z., Mao, S., & Ristaniemi, T. (2018) · IEEE Wireless Communications · doi:10.1109/mwc.2018.1700317 · Cited by 212 · cited 2×
“In recent years, there have been some interesting works conducted on content caching in mobile cellular works [7], [10], [11], [12].”
BackgroundSelf-citationOn the Complexity of Optimal Request Routing and Content Caching in Heterogeneous Cache Networks
Dehghan, M., Jiang, B., Seetharam, A., He, T., Salonidis, T., Kurose, J., Towsley, D., & Sitaraman, R. (2017) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2016.2636843 · Cited by 107 · cited 1×
“Considering that the paths to the back-end server were either congestion-sensitive or conges-tion-insensitive, the work in [29] investigated the joint content caching and routing problem to minimize the average content access delay.”
Background
Metadata
- Authors
- Li, Y., Ma, H., Wang, L., Mao, S., & Wang, G.
- Venue
- IEEE Transactions on Mobile Computing
- Published
- 2022-06-01
- Volume
- 21
- Issue
- 6
- Pages
- 2130-2142
- ISSN
- 1536-1233 (ISSN-L)
- 1558-0660
- 2161-9875
- OpenAlex
- W3095147220
- Cited by
- 222
- References
- 4
- FWCI
- 18.27
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.