2022
DOI: 10.1109/lnet.2022.3192173
|View full text |Cite
|
Sign up to set email alerts
|

Demand-Aware Cooperative Content Caching in 5G/6G Networks With MEC-Enabled Edges

Abstract: Today, billions of smart devices are interconnected via wireless networks, leading to large volumes of video contents circulating through the bandwidth-limited backhaul. This causes network performance to deteriorate. As a mitigation mechanism, caching of highly popular contents to network edges is deployed. We propose a cooperative and demandaware caching strategy, which is modelled using the Separable Assignment Problem, to maximize the cache hit ratio. This problem is solved with a recursive enumeration met… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 15 publications
(19 reference statements)
0
3
0
Order By: Relevance
“…At the beginning of each cache period, the ENSP will announce a service fee for content n and the service fee is fixed for the whole cache period. Intuitively, for cache period l, the ENSP sets the service fee as a linear function of the average AoI that all user requests for content n can achieve in cache period l. 4 For cache period l, the average AoI of content n, denoted by A n (l), is expressed as…”
Section: B Utility Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…At the beginning of each cache period, the ENSP will announce a service fee for content n and the service fee is fixed for the whole cache period. Intuitively, for cache period l, the ENSP sets the service fee as a linear function of the average AoI that all user requests for content n can achieve in cache period l. 4 For cache period l, the average AoI of content n, denoted by A n (l), is expressed as…”
Section: B Utility Modelmentioning
confidence: 99%
“…The work in [3] maximized cache hit rate by proposing a two-step framework, in which a suitable coding scheme was adopted first, and then a joint cache placement and recommendation decision algorithm based on the decision-making game was developed. The work in [4] modelled the hit-rate maximization problem as a separable assignment problem and solved it by a recursive enumeration method. The work in [5] studied the edge caching strategies considering the content delivery and Y. Yi and G. Zhang are with the College of Information Science and Technology, Donghua University, Shanghai, China (e-mails: yuhanyi@mail.dhu.edu.cn, glzhang@dhu.edu.cn).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation