In this paper, we design a caching replacement algorithm for edge networks to enhance the cache hit ratio of the edge network and reduce the traffic usage in the backbone network. Firstly, we design a dynamic-game model to represent the caching behavior between edge servers where each server takes the cache content of other servers into account to make their own caching decisions. Secondly, we analyze the utility function of edge servers from the perspective of caching contents. Finally, we derive the Nash equilibrium solution of the dynamic-game model and design a caching replacement algorithm to obtain the Nash equilibrium solution. Numerical results prove that the proposed edge caching replacement algorithm based on dynamic-game model improves the edge hit ratio up to 80% and meanwhile reduces 40% backbone traffic compared to the baseline solution.
Dynamic Game-based Caching Replacement in Edge Networks
2022-06-01
348208 byte
Conference paper
Electronic Resource
English
Contract Based Edge Caching in Vehicular Networks
Springer Verlag | 2020
|Mobile edge caching in heterogeneous vehicular networks
TIBKAT | 2022
|Novel Replacement Algorithm for Web Caching
British Library Online Contents | 2003
|