CDN Cache Allocation Strategies Based On The Network Behaviors

In this thesis, we study the lying behaviors taken by selfish source servers in CDN and propose a fair algorithm to ensure the fairness of the distribution.We achieve some goals in this thesis:(1) Maxmize the system throughput. To achieve this goal, we introduce proportional allocation in the fair algorithm.(2) the fairness of the distribution. We analysis the essence of the lying behaviors of the selfish source servers are that they will honestly apply for cache when the allocated cache satisfies their demands while they will apply more(less) cache in the other situation. We propose the valid declaration to deal with the lying behaviors. The valid declarations of the source servers are their applications when the total demands are large than the total cache. In the other situation, their valid declarations are the average volume of the applications which they declare when the total demands are large than the total cache before this stage. By introducing the valid declaration in fair algorithm, we get a fair distribution.(3)Maxmize the demand satisfications of the source servers under the conditions to meet the fairness of the distribution. To achieve this goal, we introduce the price mechanism in fair algorithm. We find that the applications of the source servers are inversely proportional to the price of the unit cache. By changing the price, we can adjust the applications to maxmize the demand satisfactions of the source servers.The idea in this thesis is that (1) the background and the relate technology of this research;(2) present the model and quantify lying behavior;(3)theoretical analysis of proportional allocation, valid declaration and price mechanism in fair algorithm;(4)test the effectiveness through experiments and compare fair algorithm with other algorithm.