pith. sign in

arxiv: 1608.00067 · v2 · pith:AYKB7BCRnew · submitted 2016-07-30 · 💻 cs.NI

Octopus: A Cooperative Hierarchical Caching Strategy for Cloud Radio Access Networks

classification 💻 cs.NI
keywords cachecachingaccesscloudcontentstrategyalgorithmcloud-based
0
0 comments X
read the original abstract

Recently, implementing Radio Access Network (RAN) functionalities 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 Cloud-based RAN (C-RAN) systems through cooperative hierarchical caching which minimizes the network costs of content delivery and improves users' Quality of Experience (QoE). In particular, we consider the cloud-cache in the cloud processing unit (CPU) as 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Joint Functional Splitting and Content Placement for Green Hybrid CRAN

    cs.NI 2019-06 unverdicted novelty 4.0

    A constraint programming formulation jointly optimizes functional splitting and content placement in H-CRAN to minimize power consumption subject to content access delay constraints, with analysis of the power-bandwid...