Cache Replacement Algorithm Based on Dynamic Constraints in Microservice Platform

Distributed cache is one of the most important components in cloud computing and microservice systems. Adding cache components to the microservice system can significantly improve the concurrency and throughput of the whole microservice framework, and effectively promote the overall performance of the microservice system. However, traditional caching algorithm can easily lead to the imbalance of cache resource allocation in microservice system, thus affecting the performance of the microservice system. We study the basic architecture of cache in microservice platform, and propose the mathematical model of distributed cache and the probability distribution model of data access in microservice platform. Next, based on the above mathematical model, we design a cache replacement algorithm based on dynamic constraints in microservice platform. The algorithm can effectively solve a series of problems of traditional algorithms in microservice platform, making the algorithm more suitable for the environment of microservice architecture. We evaluate and verify the algorithm on the simulation software platform. Experimental results show that the algorithm meets the performance requirements of high cache hit rate, high concurrency and high throughput in the microservice platform, and is significantly better than the traditional cache algorithms.