Paper Info
Title
Q-Learning Based Content Placement Method for Dynamic Cloud Content Delivery Networks.
Abstract
How to reduce the content placement cost of cloud content delivery networks (CCDNs) is a hot topic in recent years. Traditional content placement methods mainly reduce the cost of content placement by constructing delivery trees, but they cannot adapt to the dynamic deployment of cloud proxy servers in the CCDNs. In addition, the traditional content placement method only provides delivery paths according to local decision-making without considering global dynamics of the congestion in the CCDNs, which is also one of the main factors causing high cost of content placement. To solve these problems, we propose a content placement model based on Q-learning for the dynamic CCDNs, called Q-content placement model (Q-CPM). This Q-learning approach can lead to better routing decisions due to up-to-date and more reliable congestion values. Then, based on the Q-CPM model, an algorithm is proposed to construct the Q-adaptive delivery tree (Q-ADT). In this algorithm, local and nonlocal congestion information is propagated over network learning packets. Through this algorithm, the paths with low congestion cost will be selected and can adapt to the dynamic cloud delivery environment. The experimental results show that the method can adapt to the dynamic changes of the CCDNs flexibly and reduce the overall congestion cost of content placement effectively.
Year
DOI
Venue
2019
10.1109/ACCESS.2019.2917564
IEEE ACCESS
Keywords
Field
DocType
Content placement,dynamic CCDNs,congestion information,Q-learning
Content delivery,Computer science,Computer network,Q-learning,Cloud computing,Distributed computing
Journal
Volume
ISSN
Citations 
7
2169-3536
0
PageRank 
References 
Authors
0.34
0
5
Name
Order
Citations
PageRank
Liu Yujie112224.79
Dianjie Lu25210.88
Guijuan Zhang36713.28
Jie Tian403.38
XU Wei-Zhi5368.65