On Optimal Proactive Caching for Mobile Networks With Demand Uncertainties
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Mobile data users are known to possess predictable characteristics both in their interests and activity patterns. Yet, their service is predominantly performed, especially at the wireless edges, “reactively” at the time of request, typically when the network is under heavy traffic load. This strategy incurs excessive costs to the service providers to sustain on-time (or delay-intolerant) delivery of data content, while their resources are left underutilized during the light-loaded hours. This motivates us in this work to study the problem of optimal “proactive” caching whereby, future delay-intolerant data demands can be served within a given prediction window ahead of their actual time-of-arrival to minimize service costs. To that end, we first establish fundamental bounds on the minimum possible cost achievable by any proactive policy, as a function of the prediction uncertainties. These bounds provide interesting insights on the impact of uncertainty on the maximum achievable proactive gains. We then propose specific proactive caching strategies, both for uniform and fluctuating demand patterns, that are asymptotically-optimal in the limit as the prediction window size grows while the prediction uncertainties remain fixed. We further establish the exponential convergence rate characteristics of our proposed solutions to the optimal, revealing close-to-optimal performance characteristics of our designs even with small prediction windows. Also, proactive design is contrasted with its reactive and delay-tolerant counter-parts to obtain interesting results on the unavoidable costs of uncertainty and the potentially remarkable gains of proactive operation.
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
Limits of Predictability in Human Mobility
Song, C., Qu, Z., Blumm, N., & Barabási, A.-L. (2010) · Science · doi:10.1126/science.1177170 · Cited by 3,234
Cited by
AI-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
Echo State Networks for Proactive Caching in Cloud-Based Radio Access Networks With Mobile Users
Chen, M., Saad, W., Yin, C., & Debbah, M. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2683482 · Cited by 176
“Unlike previous studies such as [9], [19] and [22], which require full knowledge of the users’ content request distributions, we propose a novel approach to perform proactive content caching based on the powerful frameworks of echo state networks (ESNs) and sublinear algorithms [25].”
BackgroundMethodLearning Based Content Caching and Sharing for Wireless Networks
Song, J., Sheng, M., Quek, T. Q. S., Xu, C., & Wang, X. (2017) · IEEE Transactions on Communications · doi:10.1109/tcomm.2017.2713384 · Cited by 144
Quantum Search Algorithms for Wireless Communications
Botsinis, P., Alanis, D., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2882385 · Cited by 149
Metadata
- Authors
- Tadrous, J., & Eryilmaz, A.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2016-10
- Volume
- 24
- Issue
- 5
- Pages
- 2715-2727
- ISSN
- 1063-6692 (ISSN-L)
- 1558-2566
- OpenAlex
- W2525360329
- Cited by
- 72
- References
- 1
- FWCI
- 16.88
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On Optimal Proactive Caching for Mobile Networks With Demand Uncertainties. https://app.cochat.ai/papers/10.1109/tnet.2015.2478476
- The paper
- Tadrous, J., & Eryilmaz, A. (2016). On Optimal Proactive Caching for Mobile Networks With Demand Uncertainties. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/tnet.2015.2478476
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.