首页 | 官方网站   微博 | 高级检索  
     

基于协作小小区与流行度预测的在线热点视频缓存更新策略
引用本文:张超,李可,范平志.基于协作小小区与流行度预测的在线热点视频缓存更新策略[J].计算机应用,2019,39(7):2044-2050.
作者姓名:张超  李可  范平志
作者单位:西南交通大学信息科学与技术学院,成都,611756;西南交通大学信息科学与技术学院,成都,611756;西南交通大学信息科学与技术学院,成都,611756
基金项目:国家自然科学基金重点项目(61731017);中央高校项目(2682015CX072);国家留学基金委资助项目(201807005038);四川省科技支撑计划项目(2016GZ0138)。
摘    要:针对无线移动设备数量的指数增长使得异构协作小小区(SBS)将承载大规模的流量负载问题,提出了一种基于协作SBS与流行度预测的在线热点视频缓存更新方案(OVCRP)。首先,分析在线热点视频的流行度在短期内变化情况;然后,构建k近邻模型进行在线热点视频流行度的预测;最后,确定在线热点视频的缓存更新位置。为了选择合适的位置存放在线热点视频,以最小化总体传输时延为目标,建立数学模型,设计整数规划优化算法。仿真实验结果显示,与随机缓存(RANDOM)、最近最少使用(LRU)、最不经常使用(LFU)方案相比,OVCRP在平均缓存命中率和平均访问时延方面具有明显的优势,因此减轻了协作SBS的网络负担。

关 键 词:异构网络  在线热点视频  k近邻模型  流行度预测  缓存更新
收稿时间:2018-12-13
修稿时间:2019-03-01

Online-hot video cache replacement policy based on cooperative small base stations and popularity prediction
ZHANG Chao,LI Ke,FAN Pingzhi.Online-hot video cache replacement policy based on cooperative small base stations and popularity prediction[J].journal of Computer Applications,2019,39(7):2044-2050.
Authors:ZHANG Chao  LI Ke  FAN Pingzhi
Affiliation:School of Information Science and Technology, Southwest Jiaotong University, Chengdu Sichuan 611756, China
Abstract:The exponential growth in the number of wireless mobile devices leads that heterogeneous cooperative Small Base Stations (SBS) carry large-scale traffic load. Aiming at this problem, an Online-hot Video Cache Replacement Policy (OVCRP) based on cooperative SBS and popularity prediction was proposed. Firstly, the changes of popularity in short term of online-hot videos were analyzed, then a k-nearest neighbor model was constructed to predict the popularities of the online-hot videos, and finally the locations for cache replacement of online-hot videos were determined. In order to select appropriate locations to cache the online-hot videos, with minimization of overall transmission delay as the goal, a mathematical model was built and an integer programming optimization algorithm was designed. The simulation experiment results show that compared with the schemes such as RANDOM cache (RANDOM), Least Recently Used (LRU) and Least Frequently Used (LFU), the proposed OVCRP has obvious advantages in average cache hit rate and average access delay, reducing the network burden of cooperative SBS.
Keywords:heterogeneous network  online-hot video  k-Nearest Neighbor (kNN) model  popularity prediction  cache replacement  
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号