A novel game particle-field approach to parallel cache resource allocation of CDN

Abstract

This paper proposes a general expression for the framework of content delivery network and a novel and interesting game particle-field (G-PF) approach to content distribution problem. The game particle-field approach maps publisher-surrogate cache resource allocation problem to the movement of particles in two dual particle-fields by corresponding mathematical model in which all particles move according to certain defined rules until reaching a stable state. By anti-mapping the stable state, the solution to publisher-surrogate cache resource allocation problem can be obtained. The authors give proofs of the proposed approach in the consistency between physical model and mathematical model, the feasibility and correctness of the approach, and the existing and convergence of the solution. A distributed and parallel game particle-field replacement algorithm for cache resource allocation is introduced. As this replacement is cooperation-based, it has advantages over other replacement algorithms such as MFU, LFU, LRU. The authors prove that the replacement algorithm can reach Pareto optimization can approach the optimal solution achievable by any replacement algorithm.