电子学报 ›› 2017, Vol. 45 ›› Issue (11): 2649-2655.DOI: 10.3969/j.issn.0372-2112.2017.11.011

• 学术论文 • 上一篇    下一篇

面向软件定义无线接入网的高效协作内容缓存算法

张涛1, 李强1, 张继良2, 张蔡霞1   

  1. 1. 华中科技大学电子信息与通信学院, 湖北武汉 430074;
    2. 兰州大学信息科学与工程学院, 甘肃兰州 730000
  • 收稿日期:2016-08-07 修回日期:2017-04-05 出版日期:2017-11-25
    • 通讯作者:
    • 李强
    • 作者简介:
    • 张涛,男,1987年生,硕士生,研究方向为下一代无线通信系统、内容缓存、软件定义网络、D2D通信.E-mail:tao_n_zhang@hust.edu.cn;张继良,男,1985年出生,兰州大学副教授,目前研究的方向集中于高能效无线通信技术,多天线技术,无线定位技术和无线电波传播特性建模等.E-mail:zhangjiliang@lzu.edu.cn;张蔡霞,女,1992年生,硕士生,研究方向为下一代无线通信系统、软件定义网络、内容缓存.E-mail:cxzhang_rosy@hust.edu.cn
    • 基金资助:
    • 国家自然科学基金委NSFC-AF项目 (中芬/国际 (地区)合作与交流项目) (No.61461136004)

An Efficient Cooperative Content Caching Algorithm for Software-Defined Radio Access Networks

ZHANG Tao1, LI Qiang1, ZHANG Ji-liang2, ZHANG Cai-xia1   

  1. 1. School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan, Hubei 430074, China;
    2. School of Information Science and Engineering, Lanzhou University, Lanzhou, Gansu 730000, China
  • Received:2016-08-07 Revised:2017-04-05 Online:2017-11-25 Published:2017-11-25
    • Supported by:
    • Cooperation and Exchange Program of National Natural Science Foundation of China  (NSFC) and The Academy of Finland  (AF) (No.61461136004)

摘要: 为了缓解海量的移动业务数据与容量受限的无线接入网回传链路之间的矛盾,本文提出一种面向软件定义无线接入网(SD-RAN)的协作内容缓存网络架构.在宏蜂窝基站(MBS)的控制管理下,小蜂窝基站(SBS)可以在存储单元有序存储一些高流行度的内容.针对SBS存储单元空间受限问题,进一步提出SD-RAN网络架构下的协作内容缓存算法.该算法中,每个SBS缓存空间被分割成两部分:(1)用于存储全网流行度最高的公共内容以保证各小蜂窝小区本地命中率.(2)用于存储流行度较高的差异化的内容以促进MBS内SBS之间的协作.在此基础上,解析推导具有最优平均内容获取开销的分割参数闭合表达式.仿真结果表明该算法在不同系统参数条件下能显著降低SD-RAN的平均内容获取开销.

关键词: 软件定义无线接入网, 内容流行度, 协作缓存, 内容获取开销

Abstract: In order to alleviate the contradiction between the massive mobile data traffic and the limited capacity of wireless backhaul links,a cooperative content caching algorithm is proposed for Software-Defined Radio Access Networks (SD-RAN),where the Macro-cell Base Station (MBS) equipped with centralized control logic and programmable interfaces,coordinates the content caching performed at the Small-cell Base Stations (SBSs).Moreover,in order to strike a balance between the local hit ratio and miss ratio,a cooperative caching algorithm is proposed by dividing the cache space of each SBS into two portions,one for storing the most popular contents that are the same across SBSs,one for storing unique contents to facilitate inter-SBSs cooperation.The optimal partition factor at which the average content provisioning cost of the SD-RAN is minimized is analytically obtained in a closed form.

Key words: software-defined radio access networks, content popularity, cooperative caching, content provisioning cost

中图分类号: