Placement Strategy for Replicated Servers in CDN
Qitao Shi, Xiaofan Wang, Lin Wang · 2018
Study of Content Distribution Networks(CDNs) attracts increasing attentions recently. Deploying a set of servers across the Internet containing replicated content will certainly provide users with better experience by reducing request latency and balancing the load. However, due to the large-scale and high-volume requests from the users, quantities of proxy servers are needed resulting in high cost of facilities. Therefore, it is necessary to find an optimal replicated-server placement that can improve Internet performance while controlling the budget. To solve this problem, we first propose a new model, C FLPEC, based on which the nature of Internet can be described. In addition, we analyze the feasibility and compare several lower bound algorithms of the new model. Based on C FLPEC, we testify the performance of the network-segmentation algorithm. The proposed algorithm uses K-means algorithm to cluster the network and for each cluster, greedy algorithm is applied to find out an approximate placement in this area. As we obtain the solutions for all the clusters respectively, we merge them to constitute the final solution for the whole network. Instead of directly stitching them together, possible situations that will occur on the boundaries between two clusters are also taken into consideration. Finally, we learn from the natural characteristics of the Internet to construct the simulation model, and simulation results illustrate the feasibility and effectiveness of the proposed algorithm.