Optimizing Cache Placement for Heterogeneous Small Cell Networks

Liao, Jialing; Wong, Kai-Kit; Khandaker, Muhammad R. A.; Zheng, Zhongbin

doi:10.1109/lcomm.2016.2612197

Cited by 53 publications

(46 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Proactive caching consists in taking proactive measures to cache future popular contents and treat popularity prediction algorithms in order to predict user demand and conclude which contents are cached and which are dismissed. The related researches mainly focused on minimizing the file access latency (eg, Zhou et al), reducing the transmission cost of the backhaul (eg, Liao et al), or both of them (eg, Li et al), maximizing the cache hit ratio (eg, previous studies), enhancing security transmission (eg, Shi et al), size of content offload (eg, Wang et al), average caching failure probability (eg, Kang HJ and Kang CG). Others focused on energy saving (eg, previous studies).…”

Section: Related Work In Proactive Edge Caching and Contributionmentioning

confidence: 99%

Dynamic theoretic proactive caching placement game for energy saving in H‐CRAN

Mrad

Hamouda

2020

Int J Communication

View full text Add to dashboard Cite

Summary Edge caching is an effective feature of the next 5G network to guarantee the availability of the service content and a reduced time response for the user. However, the placement of the cache content remains an issue to fully take advantage of edge caching. In this paper, we address the proactive caching problem in Heterogeneous Cloud Radio Access Network (H‐CRAN) from a game theoretic point of view. The problem is formulated as a bargaining game where the remote radio heads (RRHs) dynamically negotiate and decide which content to cache in which RRH under energy saving and cache capacity constraints. The Pareto optimal equilibrium is proved for the cooperative game by the iterative Nash bargaining algorithm. We compare between cooperative and noncooperative proactive caching games and demonstrate how the selfishness of different players can affect the overall system performance. We also showed that our cooperative proactive caching game improves the energy consumption of 40% as compared with noncooperative game and of 68% to no‐game strategy. Moreover, the number of satisfied requests at the RRHs with the proposed cooperative proactive caching scheme is significantly increased.

show abstract

Section: Related Work In Proactive Edge Caching and Contributionmentioning

confidence: 99%

Dynamic theoretic proactive caching placement game for energy saving in H‐CRAN

Mrad

Hamouda

2020

Int J Communication

View full text Add to dashboard Cite

show abstract

“…In recent years, content deployment strategies with different optimization objectives in HetNets have been studied [11][12][13][14][15][16]. The authors in [11,12] aim to maximize the cache hit probability, defined as the probability that a file requested by the typical user is delivered successfully to the user, to achieve the optimal cache content placement strategies.…”

Section: Content Placement Schemes Of Hetnetsmentioning

confidence: 99%

“…In [15], the authors investigate the content placement problem in a HetNet where a tier of multi-antenna macro BSs (MBSs) is overlaid with a tier of helpers with caches and propose an optimal content placement strategy which maximizes the successful offloading probability of the MBSs. The authors in [16] study the cache content placement problem in caching enabled small cell networks to minimize the average backhaul load subject to the cache capacity constraints. The optimization problem is formulated and solved to obtain the optimal cache content placement strategy.…”

Section: Content Placement Schemes Of Hetnetsmentioning

confidence: 99%

“…It has been shown in previous research works that the transmission performance of UEs can be enhanced significantly by caching contents at the infrastructures of the RANs [11][12][13][14][15][16]; hence, designing reasonable cache content placement schemes by taking into account both caching constraints and possible performance enhancement is of particular importance. However, while most of previous research works study user association problem or cache content placement problem independently, these two problems are indeed closely related.…”

Section: Introductionmentioning

confidence: 99%

“…• The problem of user association or content placement in HetNets has been studied separately in previous works [2][3][4][5][6][7] and [11][12][13][14][15][16]. In this paper, we jointly consider the user association and content placement problem in cache-enabled HetNets and design jointly optimal strategies so that the overall performance of the networks can be maximized.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Network utility optimization-based joint user association and content placement in heterogeneous networks

Chen

Chai

et al. 2018

J Wireless Com Network

View full text Add to dashboard Cite

The rapid growth of traffic demands has posed challenges and difficulties on both the radio access networks (RANs) and the backhaul links. While heterogeneous networks (HetNets) are expected to offer diverse radio access capabilities and improve the transmission performance of user equipments (UEs) significantly through integrating various RANs efficiently, the backhaul links may still experience challenges in offering quality of service (QoS) guaranteed services to UEs. To tackle these problems, caching technology, more specifically, caching user contents at the infrastructures of different RANs is proposed as an effective approach. In this paper, we consider the joint user association and cache content placement problem in cache-enabled HetNets. Stressing the tradeoff between user download delay and caching cost, we introduce the concept of utility function which characterizes the joint network performance as the weighted sum of user download delay and the caching cost and formulate the joint user association and cache content placement problem as a network utility optimization problem. As the formulated optimization problem is a nonlinear integer optimization problem which cannot be solved conveniently using traditional optimization tools, we transform the original optimization problem equivalently into three convex subproblems by applying Lagrange partial relaxation and McCormick envelopes, and then propose an iterative algorithm. Within each iteration, for a given set of Lagrange multipliers, the three subproblems are solved respectively by means of the modified Kuhn-Munkres (K-M) algorithm and the locally optimal solutions can be obtained, based on which the Lagrange multipliers can be updated through applying subgradient method. Simulation results demonstrate the effectiveness of the proposed algorithm.

show abstract

Caching in heterogeneous satellite networks with fountain codes

Recayte

Lázaro

Liva

2019

Satell Commun Network

View full text Add to dashboard Cite

In this paper we investigate the performance of caching schemes based on fountain codes in a heterogeneous satellite network. We consider multiple cache-aided hubs which are connected to a geostationary satellite through backhaul links. With the aim of reducing the average number of transmissions over the satellite backhaul link, we propose the use of a caching scheme based on fountain codes. We derive a simple analytical expression of the average backhaul transmission rate and provide a tight upper bound on it. Furthermore, we show how the performance of the fountain code based caching scheme is similar to that of a caching scheme based on maximum distance separable codes.

show abstract

Optimizing Cache Placement for Heterogeneous Small Cell Networks

Cited by 53 publications

References 13 publications

Dynamic theoretic proactive caching placement game for energy saving in H‐CRAN

Dynamic theoretic proactive caching placement game for energy saving in H‐CRAN

Network utility optimization-based joint user association and content placement in heterogeneous networks

Caching in heterogeneous satellite networks with fountain codes

Contact Info

Product

Resources

About