CoChat

Learning Based Content Caching and Sharing for Wireless Networks

Song, Jiongjiong, Sheng, Min, Quek, Tony Q.S., Xu, Chao, Wang, Xijun · 2017 · IEEE Transactions on Communications

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

Abstract

Content caching at base stations (BSs) is a promising technique for future wireless networks by reducing network traffic and alleviating server bottleneck. However, in practice, the content popularity distribution may change with spatio-temporal variation but be unknown for BSs, which is an intractable obstacle for efficient caching strategy design. In this paper, considering unknown popularity distribution, we explore the content caching problem by jointly optimizing the content caching in cooperative BSs, content sharing among BSs, and cost of content retrieving. We tackle the problem from a multi-armed bandit learning perspective, where the learning of the popularity distribution is incorporated with the content caching and sharing process. Specifically, we first propose a centralized algorithm by employing a semidefinite relaxation approach, and we prove that this centralized algorithm learns efficient caching by deriving a sub-linear learning regret bound. To further reduce computational complexity, we propose a distributed algorithm based on alternating direction method of multipliers, where each BS only solves their own problems by exchanging local information with neighbor BSs. Extensive simulation results show the effectiveness of the proposed algorithms in terms of learning content popularity distributions of individual BSs, offloading traffic from the content server, and reducing cost of content retrieving.

Overview

Integrity signals

Registry

Crossref · 10.1109/tcomm.2017.2713384

Cites

37 of 37 references verified0 citation errors · 0 not checkable

Statistics

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

Verification

Claims the paper makes

This paper’s full text isn’t openly available, 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?

Citations

Cites

Research works printed but not linked: 2

  1. grant, 2013, CVX Matlab Software for Disciplined Convex Programming Version 2 0
  2. 2016, Cisco Visual Networking Index Forecast and Methodology 2015–2020

Cited by

See all 144

Metadata

Authors
Song, J., Sheng, M., Quek, T. Q. S., Xu, C., & Wang, X.
Affiliations
  • Xidian University (CN)
  • Singapore University of Technology and Design (SG)
Venue
IEEE Transactions on Communications
Published
2017
Pages
1-1
ISSN
0090-6778 (ISSN-L)
OpenAlex
W2624186268
Cited by
144
References
37
Citations by year
2026: 1 · 2025: 4 · 2024: 13 · 2023: 11 · 2022: 10 · 2021: 23 · 2020: 27 · 2019: 39 · 2018: 16
FWCI
14.92
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Communications (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Caching and Content Delivery
  • Physical Sciences › Computer Science › Computer Networks and Communications › Age of Information Optimization
  • Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
Keywords
content caching, content sharing, base station, multi-armed bandits, cooperative caching, semidefinite relaxation, distributed algorithms, alternating direction method of multipliers, traffic offloading, wireless networks

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.