Skip to main navigation Skip to search Skip to main content

基于随机几何理论的流行度匹配边缘缓存策略

Translated title of the contribution: Popularity Matching Edge Caching Policy Based on Stochastic Geometry Theory
  • Haoyang Liu
  • , Gang Wang*
  • , Wenchao Yang
  • , Jinlong Wang
  • , Yao Xu
  • , Donglai Zhao
  • *Corresponding author for this work
  • School of Electronics and Information Engineering, Harbin Institute of Technology

Research output: Contribution to journalArticlepeer-review

Abstract

Edge caching mechanism for heterogeneous network is one of the reliable technologies to solve the excessive link load of the traditional backhaul mechanism, but the existing caching policies often can not match the popularity of the required data. To solve this problem, a Popularity Matching Caching Policy (PMCP) is proposed in this paper, which can match the corresponding file cache probability according to the popularity parameters to maximize communication reliability and reduce backhaul bandwidth pressure. The plane position of the base station is modeled by stochastic geometry theory. The results of the Monte Carlo simulation show that the proposed caching policy can effectively reduce the backhaul bandwidth pressure, and the reliability of the proposed caching policy is better than the comparison policies.

Translated title of the contributionPopularity Matching Edge Caching Policy Based on Stochastic Geometry Theory
Original languageChinese (Traditional)
Pages (from-to)3427-3433
Number of pages7
JournalDianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology
Volume43
Issue number12
DOIs
StatePublished - Dec 2021
Externally publishedYes

Fingerprint

Dive into the research topics of 'Popularity Matching Edge Caching Policy Based on Stochastic Geometry Theory'. Together they form a unique fingerprint.

Cite this