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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Dynamic Game-based Caching Replacement in Edge Networks


    Contributors:
    Gu, Huixian (author) / Cai, Weiwen (author) / Zhao, Liqiang (author) / Luo, Weimin (author) / Zhou, Guorong (author) / Chen, Qiming (author) / Tu, Haiyan (author) / Wang, Zhigang (author) / Li, Shuchun (author)


    Publication date :

    2022-06-01


    Size :

    348208 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Contract Based Edge Caching in Vehicular Networks

    Su, Zhou / Hui, Yilong / Luan, Tom H. et al. | Springer Verlag | 2020


    Mobile edge caching in heterogeneous vehicular networks

    Wu, Huaqing / Lyu, Feng / Shen, Xuemin | TIBKAT | 2022


    A Review on AI-Enabled Content Caching in Vehicular Edge Caching and Networks

    Masood, Arooj / Tuan, Do Quang / Lakew, Demeke Shumeye et al. | IEEE | 2023


    Novel Replacement Algorithm for Web Caching

    Xingjun, Z. / Depei, Q. / Weiguo, W. | British Library Online Contents | 2003