Octopus: A Cooperative Hierarchical Caching Strategy for Cloud Radio Access Networks
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Recently, implementing Radio Access Network (RAN) functionality on cloud-based computing platform has become an emerging solution that leverages the many advantages of cloud infrastructure, such as shared computing resources and storage capacity, while lowering the operational cost. In this paper, we propose a novel caching framework aimed at fully exploiting the potential of such systems through cooperative hierarchical caching which minimizes the network costs of content delivery and improves users' Quality of Experience (QoE). In particular, the cloud-cache in the cloud processing unit (CPU) presents a new layer in the RAN cache hierarchy, bridging the capacity-performance gap between the traditional edge-based and core-based caching schemes. A delay cost model is introduced to characterize and formulate the cache placement optimization problem, which is shown to be NP-complete. As such, a low complexity, heuristic cache management strategy is proposed, constituting of a proactive cache distribution algorithm and a reactive cache replacement algorithm. Extensive numerical simulations are carried out using both real-world YouTube video requests and synthetic content requests. It is demonstrated that our proposed Octopus caching strategy significantly outperforms the traditional caching strategies in terms of cache hit ratio, average content access delay and backhaul traffic load.
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
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 4×
“To compensate for the relative small cache size at the BSs, the authors in [12] consider caches both in the RAN edge and in the Evolved Packet Core (EPC).”
BackgroundInfluentialMaximizing a Monotone Submodular Function Subject to a Matroid Constraint
Calinescu, G., Chekuri, C., Pál, M., & Vondrák, J. (2011) · SIAM Journal on Computing · doi:10.1137/080733991 · Cited by 795 · cited 2×
“In particular, we will show that problem (9) belongs to the classical class of problems of maximizing a monotone submodular function over a matroid constraint [21], [22].”
Background
Cited by
Collaborative Mobile Edge Computing in 5G Networks: New Paradigms, Scenarios, and Challenges
Tran, T. X., Hajisami, A., Pandey, P., & Pompili, D. (2017) · IEEE Communications Magazine · doi:10.1109/mcom.2017.1600863 · Cited by 874
Self-citationChen, M., Mozaffari, M., Saad, W., Yin, C., Debbah, M., & Hong, C. S. (2017) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2017.2680898 · Cited by 742
A Tutorial on UAVs for Wireless Networks: Applications, Challenges, and Open Problems
Mozaffari, M., Saad, W., Bennis, M., Nam, Y.-H., & Debbah, M. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2902862 · Cited by 299
A Survey on the Placement of Virtual Resources and Virtual Network Functions
Laghrissi, A., & Taleb, T. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2884835 · Cited by 291
Cooperative Edge Caching in User-Centric Clustered Mobile Networks
Zhang, S., He, P., Suto, K., Yang, P., Zhao, L., & Shen, X. (2018) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2017.2780834 · Cited by 279
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
“The authors in [11] propose a novel caching framework that seeks to realize the potential of CRANs by using a cooperative hierarchical caching approach that minimizes the content delivery costs and improves the users quality-of-experience.”
BackgroundChen, M., Saad, W., & Yin, C. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2891629 · Cited by 176
Metadata
- Authors
- Tran, T. X., & Pompili, D.
- Venue
- 2016 IEEE 13th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)
- Publisher
- IEEE
- Published
- 2016-10
- Pages
- 154-162
- OpenAlex
- W2475565537
- Cited by
- 71
- References
- 2
- FWCI
- 12.89
- Type
- conference paper
- Language
- en
- Open access
- green
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.