北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2017, Vol. 40 ›› Issue (6): 19-23,36.doi: 10.13190/j.jbupt.2017-035

• 论文 • 上一篇    下一篇

一种基于二分图的移动网络预缓存机制

魏亮1,2, 谢俊峰1, 谢人超1, 黄韬1, 刘韵洁1,2   

  1. 1. 北京邮电大学 网络与交换技术国家重点实验室, 北京 100876;
    2. 江苏省未来网络创新研究院, 南京 211111
  • 收稿日期:2017-03-24 出版日期:2017-12-28 发布日期:2017-12-28
  • 作者简介:魏亮(1981-),男,博士生,E-mail:zgywl@bupt.edu.cn;黄韬(1980-),男,教授.
  • 基金资助:
    国家自然科学基金项目(61501042);国家高技术研究发展计划(863计划)项目(2015AA016101);北京市科技新星计划项目(Z151100000315078)

A Content Pre-Caching Mechanism Based on Bipartite Graph in Mobile Cellular Network

WEI Liang1,2, XIE Jun-feng1, XIE Ren-chao1, HUANG Tao1, LIU Yun-jie1,2   

  1. 1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China;
    2. Jiangsu Future Networks Innovation Institute, Nanjing 211111, China
  • Received:2017-03-24 Online:2017-12-28 Published:2017-12-28
  • Supported by:
     

摘要: 为了解决移动网络中高效部署缓存的问题,提出了一种基于二分图的内容预缓存机制,在选择内容预缓存的节点时,不仅要考虑该节点上的内容热度,还要考虑该节点与其他节点之间的链路状态,用以选择对内容热度最高、网络状态最好的节点来预缓存内容,从而提高内容分发效率.仿真结果表明,该方法可以有效地提升缓存空间的利用效率,降低内容传输时延,增强用户体验.

关键词: 移动网络, 链路状态, 内容预缓存, 内容分发

Abstract: In order to solve the problem of efficient deployment caching in mobile networks, a content caching mechanism based on bipartite graph was proposed. When selecting the content caching nodes, it is necessary to consider not only the content's interest degree in each node, but also the link states between nodes. Based on this scheme, those nodes which are most interested in the content and have the best network status will be selected to pre-cache the content, thereby improving the content distribution efficiency and reducing the content transmission delay. Simulation results are illustrated to show that the proposed scheme can improve the utilization efficiency of cache space, reduce the content transmission delay and enhance users' experience.

Key words: mobile cellular network, link status, content pre-caching, content distribution

中图分类号: