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

ZHANG Tao; LI Qiang; ZHANG Ji-liang; ZHANG Cai-xia

doi:10.3969/j.issn.0372-2112.2017.11.011

您当前的位置：

首页 >

文章列表页 >

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

更新时间：2025-07-16

- An Efficient Cooperative Content Caching Algorithm for Software-Defined Radio Access Networks
- Acta Electronica Sinica Vol. 45, Issue 11, Pages: 2649-2655(2017)
- 作者机构：
  
  1. 华中科技大学电子信息与通信学院,湖北,武汉,430074
  2. 兰州大学信息科学与工程学院,甘肃,兰州,730000
  3. 华中科技大学电子信息与通信学院,湖北,武汉,430074
  4. 兰州大学信息科学与工程学院,甘肃,兰州,730000
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2017.11.011
  CLC： TN915.65
- Published Online：25 November 2017，
  
  Published：2017
- 稿件说明：
移动端阅览
ZHANG Tao, LI Qiang, ZHANG Ji-liang, et al. An Efficient Cooperative Content Caching Algorithm for Software-Defined Radio Access Networks[J]. Acta Electronica Sinica, 2017, 45(11): 2649-2655.
DOI：

ZHANG Tao, LI Qiang, ZHANG Ji-liang, et al. An Efficient Cooperative Content Caching Algorithm for Software-Defined Radio Access Networks[J]. Acta Electronica Sinica, 2017, 45(11): 2649-2655. DOI： 10.3969/j.issn.0372-2112.2017.11.011.

摘要

为了缓解海量的移动业务数据与容量受限的无线接入网回传链路之间的矛盾，本文提出一种面向软件定义无线接入网（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.

关键词

Keywords

references

Views

325

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰