Cache Location in Tree Networks: Preliminary Results

Pierre, Bauguion; Walid, Ben Ameur; Gourdin, Éric

doi:10.1007/978-3-642-21527-8_56

Cited by 1 publication

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To solve this problem, most CPs use a multicast tree structure to enhance the scalability while reducing the network overhead in the content delivery processes. Pierre et al [7] proposed a tree building algorithm and designed a content replacement strategy based on the hot part of the replica. This method has good scalability, but it does not consider the influence of network congestion.…”

Section: Related Workmentioning

confidence: 99%

“…Content placement is one of the key technologies in CCDNs. To save the cost of content placement, the CPs usually reduce the number of replicas by building the multicast delivery trees [7]. However, most delivery tree building methods aims at static networks and cannot adapt to the dynamic characteristics of frequent changes of cloud proxy server in CCDNs.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Q-Learning Based Content Placement Method for Dynamic Cloud Content Delivery Networks

Liu¹,

Lu²,

Zhang³

et al. 2019

IEEE Access

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%