The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Approximation Algorithms for Mobile Data Caching in Small Cell Networks
Abstract
Small cells constitute a promising solution for managing the mobile data growth that has overwhelmed network operators. Local caching of popular content items at the small cell base stations (SBSs) has been proposed to decrease the costly transmissions from the macrocell base stations without requiring high capacity backhaul links for connecting the SBSs with the core network. However, the caching policy design is a challenging problem especially if one considers realistic parameters such as the bandwidth capacity constraints of the SBSs that can be reached in congested urban areas. We consider such a scenario and formulate the joint routing and caching problem aiming to maximize the fraction of content requests served locally by the deployed SBSs. This is an NP-hard problem and, hence, we cannot obtain an optimal solution. Thus, we present a novel reduction to a variant of the facility location problem, which allows us to exploit the rich literature of it, to establish algorithms with approximation guarantees for our problem. Although the reduction does not ensure tight enough bounds in general, extensive numerical results reveal a near-optimal performance that is even up to 38% better compared to conventional caching schemes using realistic system settings.
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 1×
“niques [7], they are based on the content centric networking [8] or the “stable-matching” [38] concept, or they are designed with mobility-awareness [39] (users associate with multiple SBSs”
Background
Cited by
Wireless caching: technical misconceptions and business barriers
Paschos, G., Bastug, E., Land, I., Caire, G., & Debbah, M. (2016) · IEEE Communications Magazine · doi:10.1109/mcom.2016.7537172 · Cited by 321
Learning 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
Proactive Content Caching by Exploiting Transfer Learning for Mobile Edge Computing
Hou, T., Feng, G., Qin, S., & Jiang, W. (2017) · GLOBECOM 2017 - 2017 IEEE Global Communications Conference · doi:10.1109/glocom.2017.8254636 · Cited by 85
Metadata
- Authors
- Poularakis, K., Iosifidis, G., & Tassiulas, L.
- Venue
- IEEE Transactions on Communications
- Published
- 2014-10
- Volume
- 62
- Issue
- 10
- Pages
- 3665-3677
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2039090559
- Cited by
- 245
- References
- 1
- FWCI
- 33.52
- 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: Approximation Algorithms for Mobile Data Caching in Small Cell Networks. https://app.cochat.ai/papers/10.1109/tcomm.2014.2351796
- The paper
- Poularakis, K., Iosifidis, G., & Tassiulas, L. (2014). Approximation Algorithms for Mobile Data Caching in Small Cell Networks. IEEE Transactions on Communications. https://doi.org/10.1109/tcomm.2014.2351796
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.