Cache Allocation in CDN: An Evolutionary Game Generalized Particle Model
Content distribution networks (CDNs) increasingly have been used to reduce the response times experienced by Internet users through placing surrogates close to the clients. This paper presents an object replacement approach based on an evolutionary game generalized particle model (G-GPM). We first propose a problem model for CDNs. The CDN model is then fit into a gravitational field. The origin servers and surrogates are regarded as two kinds of particles which are located in two force-fields. The cache allocation problem is thus transformed into the kinematics and dynamics of the particles in the annular and the round force-fields. The G-GPM approach is unique in four aspects: 1) direct viewing of individual and overall optimization; 2) parallel computing (lower time complexity); 3) multi-objective solution; and 4) being able to deal with some social interactions behaviors.
KeywordsContent Delivery Networks (CDN) cache resource allocation evolutionary game generalized particle model (G-GPM) placement algorithm distributed and parallel algorithm
Unable to display preview. Download preview PDF.
- 2.Zipf, G.K.: Human Behavior and the Principle of Least Effort. Addison-Wesley, Cambridge (1949)Google Scholar
- 3.Jean-yves, L.B.: Rate adaptation, Congestion Control and Fairness: A Tutorial (2005)Google Scholar
- 4.Alexander, G.J.: Advanced Microeconomic Theory. Prentice-Hall, Englewood Cliffs (1991)Google Scholar