Edge Caching Placement Strategy based on Evolutionary Game for Conversational Information Seeking in Edge Cloud Computing

Author:

Shi Hongjian1,Zhang Meng1,Ma RuHui1,Lin Liwei2,Zhang Rui1,Guan Haibing1

Affiliation:

1. School of Electronic Information and Electronic Engineering, Shanghai Jiao Tong University, China

2. School of Computer Science and Mathematics, Fujian University of Technology, China

Abstract

In Internet applications, network conversation is the primary communication between the user and server. The server needs to efficiently and quickly return the corresponding service according to the conversation sent by the user to improve the users’ Quality of Service. Thus, Conversation Information Seeking (CIS) research has become a hot topic today. In Cloud Computing (CC), a central service mode, the conversation is transmitted between the user and the remote cloud over a long distance. With the explosive growth of Internet applications, network congestion, long-distance communication, and single point of failure have brought new challenges to the centralized service mode. People put forward Edge Cloud Computing (ECC) to meet the new challenges of the centralized service mode of CC. As a distributed service mode, ECC is an extension of CC. By migrating services from the remote cloud to the network edge closer to users, ECC can solve the above challenges in CC well. In ECC, people solve the problem of CIS through edge caching. The current research focuses on designing the edge cache strategy to achieve more predictable caching. In this paper, we propose an edge cache placement method Evolutionary Game based Caching Placement Strategy (EG-CPS). This method consists of three modules: the user preference prediction module, the content popularity calculation module, and the cache placement decision module. To maximize the predictability of the cache strategy, we are committed to optimizing the cache hit rate and service latency. The simulation experiment compares the proposed strategy with several other cache strategies. The experimental results illustrate that EG-CPS can reduce up to 2.4% of the original average content request latency, increase the average direct cache hit rate by 1.7%, and increase the average edge cache hit rate by 3.3%.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications

Reference58 articles.

1. Ibrahim Althamary , Chih-Wei Huang , Phone Lin , Shun-Ren Yang , and Chien-Wei Cheng . 2018 . Popularity-Based Cache Placement for Fog Networks . In Proceedings of the 14th International Wireless Communications & Mobile Computing Conference. IEEE, 800–804 . Ibrahim Althamary, Chih-Wei Huang, Phone Lin, Shun-Ren Yang, and Chien-Wei Cheng. 2018. Popularity-Based Cache Placement for Fog Networks. In Proceedings of the 14th International Wireless Communications & Mobile Computing Conference. IEEE, 800–804.

2. Bouchaib Assila , Abdellatif Kobbane , and Mohammed El Koutbi . 2018 . A Many-To-One Matching Game Approach to Achieve Low-Latency Exploiting Fogs and Caching . In Proceedings of the 9th IFIP International Conference on New Technologies, Mobility and Security. IEEE, 1–2. Bouchaib Assila, Abdellatif Kobbane, and Mohammed El Koutbi. 2018. A Many-To-One Matching Game Approach to Achieve Low-Latency Exploiting Fogs and Caching. In Proceedings of the 9th IFIP International Conference on New Technologies, Mobility and Security. IEEE, 1–2.

3. Maria-Florina Balcan Mikhail Khodak Dravyansh Sharma and Ameet Talwalkar. 2022. Provably Tuning the ElasticNet across Instances. (2022). arXiv:2207.10199 Maria-Florina Balcan Mikhail Khodak Dravyansh Sharma and Ameet Talwalkar. 2022. Provably Tuning the ElasticNet across Instances. (2022). arXiv:2207.10199

4. Lee Breslau , Pei Cao , Li Fan , Graham Phillips , and Scott Shenker . 1999 . Web Caching and Zipf-like Distributions: Evidence and Implications . In Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE Computer Society, 126–134 . Lee Breslau, Pei Cao, Li Fan, Graham Phillips, and Scott Shenker. 1999. Web Caching and Zipf-like Distributions: Evidence and Implications. In Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE Computer Society, 126–134.

5. Binqiang Chen and Chenyang Yang. 2017. Caching Policy Optimization for D2D Communications by Learning User Preference. (2017). arXiv:1704.04860 Binqiang Chen and Chenyang Yang. 2017. Caching Policy Optimization for D2D Communications by Learning User Preference. (2017). arXiv:1704.04860

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3