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

刘浩洋; 王钢; 杨文超; 王金龙; 许尧; 赵东来

doi:10.11999/JEIT210493

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

doi: 10.11999/JEIT210493

哈尔滨工业大学电子与信息工程学院哈尔滨 150001

基金项目: 国家自然科学基金(62071146, 62071147)

详细信息

作者简介:
刘浩洋：男，1993年生，博士生，研究方向为异构边缘计算与缓存

王钢：男，1962年生，教授，博士生导师，研究方向为数据通信、物理层网络编码、通信网理论与技术

杨文超：男，1976年生，副教授，研究方向为数据通信、无线网络架构、软件无线电

王金龙：男，1988年生，博士，研究方向为无线携能通信技术

许尧：男，1993年生，博士生，研究方向为非正交多址接入技术

赵东来：男，1991年生，博士生，研究方向为超密集组网技术

通讯作者:
王钢　gwang51@hit.edu.cn

中图分类号: TN919
计量
- 文章访问数: 851
- HTML全文浏览量: 362
- PDF下载量: 68
- 被引次数: 2
出版历程
- 收稿日期: 2021-06-01
- 修回日期: 2021-09-10
- 网络出版日期: 2021-09-25
- 刊出日期: 2021-12-21

Popularity Matching Edge Caching Policy Based on Stochastic Geometry Theory

School of Electronics and Information Engineering, Harbin Institute of Technology, Harbin 150001, China

Funds: The National Natural Science Foundation of China (62071146, 62071147)

摘要

摘要: 异构网络边缘缓存机制是解决传统回程传输链路负载过大的可靠技术之一，但已有的缓存策略往往不能与被请求数据的流行度相匹配。为了解决这一问题，该文提出一种流行度匹配边缘缓存策略(PMCP)，该策略能够根据流行度参数匹配对应的文件缓存概率以最大限度提升通信可靠性并降低回程带宽压力。基站的平面位置通过随机几何建模，文件的被请求概率则通过齐夫分布建模。蒙特卡罗仿真结果表明缓存机制能够有效降低回程带宽压力，且所提出缓存策略的可靠性优于对比策略。
- 异构网络 /
- 边缘缓存 /
- 随机几何 /
- 流行度匹配
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.
- Heterogeneous network /
- Edge caching /
- Stochastic geometry /
- Popularity matching

HTML全文

图 1 支持微基站缓存的异构网络模型

下载: 全尺寸图片幻灯片

图 2 PPP建模的基站位置分布示意图

下载: 全尺寸图片幻灯片

图 3 偏斜参数与回程带宽释放率关系图

下载: 全尺寸图片幻灯片

图 4 偏斜参数与平均中断概率关系图

下载: 全尺寸图片幻灯片

图 5 微基站密度与平均中断概率关系图

下载: 全尺寸图片幻灯片

图 6 存储容量数据库容量比与平均中断概率关系图

下载: 全尺寸图片幻灯片

参考文献(15)

[1]	MAO Yuji, YOU Changsheng, ZHANG Jun, et al. A survey on mobile edge computing: The communication perspective[J]. IEEE Communications Surveys & Tutorials, 2017, 19(4): 2322–2358. doi: 10.1109/COMST.2017.2745201
[2]	BHARATH B N, NAGANANDA K G, and POOR H V. A learning-based approach to caching in heterogenous small cell networks[J]. IEEE Transactions on Communications, 2016, 64(4): 1674–1686. doi: 10.1109/TCOMM.2016.2536728
[3]	SONG J, SONG H, and CHOI W. Optimal content placement for wireless femto-caching network[J]. IEEE Transactions on Wireless Communications, 2017, 16(7): 4433–4444. doi: 10.1109/TWC.2017.2698447
[4]	SONG J and CHOI W. Minimum cache size and backhaul capacity for cache-enabled small cell networks[J]. IEEE Wireless Communications Letters, 2018, 7(4): 490–493. doi: 10.1109/LWC.2017.2787765
[5]	KRISHNENDU S, BHARATH B N, and BHATIA V. Cache enabled cellular network: Algorithm for cache placement and guarantees[J]. IEEE Wireless Communications Letters, 2019, 8(6): 1550–1554. doi: 10.1109/LWC.2019.2926726
[6]	WANG Hongman, Li Yingxue, ZHAO Xiaoqi, et al. An algorithm based on markov chain to improve edge cache hit ratio for blockchain-enabled IoT[J]. China Communications, 2020, 17(9): 66–76. doi: 10.23919/JCC.2020.09.006
[7]	TAMOOR-UL-HASSAN S, BENNIS M, NARDELLI P H J, et al. Caching in wireless small cell networks: A storage-bandwidth tradeoff[J]. IEEE Communications Letters, 2016, 20(6): 1175–1178. doi: 10.1109/LCOMM.2016.2543698
[8]	LIU Dong and YANG Chenyang. Caching policy toward maximal success probability and area spectral efficiency of cache-enabled HetNets[J]. IEEE Transactions on Communications, 2017, 65(6): 2699–2714. doi: 10.1109/TCOMM.2017.2680447
[9]	ZHANG Tiankui, FANG Xinyuan, LIU Yuanwei, et al. D2D-enabled mobile user edge caching: A multi-winner auction approach[J]. IEEE Transactions on Vehicular Technology, 2019, 68(12): 12314–12328. doi: 10.1109/TVT.2019.2947334
[10]	杨静, 李金科. 带有特征感知的D2D内容缓存策略[J]. 电子与信息学报, 2020, 42(9): 2201–2207. doi: 10.11999/JEIT190691 YANG Jing and LI Jinke. Feature-aware D2D content caching strategy[J]. Journal of Electronics &Information Technology, 2020, 42(9): 2201–2207. doi: 10.11999/JEIT190691
[11]	HUA Haojiang and CHU Xiaoli. Content caching policy with edge caching user classification in fog radio access networks[C]. 2021 IEEE Wireless Communications and Networking Conference, Nanjing, China: IEEE, 2021: 1–7. doi: 10.1109/WCNC49053.2021.9417284.
[12]	BŁASZCZYSZYN B, KARRAY M K, and KEELER H P. Using Poisson processes to model lattice cellular networks[C]. IEEE INFOCOM, Turin, Italy: IEEE, 2013: 773–781. doi: 10.1109/INFCOM.2013.6566864.
[13]	JO H S, SANG Y J, XIA Ping, et al. Heterogeneous cellular networks with flexible cell association: A comprehensive downlink SINR analysis[J]. IEEE Transactions on Wireless Communications, 2012, 11(10): 3484–3495. doi: 10.1109/TWC.2012.081612.111361
[14]	ANDREWS J G, BACCELLI F, and GANTI R K. A tractable approach to coverage and rate in cellular networks[J]. IEEE Transactions on Communications, 2011, 59(11): 3122–3134. doi: 10.1109/TCOMM.2011.100411.100541
[15]	BRESLAU L, CAO Pei, FAN Li, et al. Web caching and Zipf-like distributions: Evidence and implications[C]. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, New York, USA: IEEE, 1999: 126–134.