[1]涂 亮,徐 雷.雾计算中基于古诺博弈的协作缓存优化算法[J].计算机技术与发展,2019,29(06):13-17.[doi:10. 3969 / j. issn. 1673-629X. 2019. 06. 003]
　TU Liang,XU Lei.Cooperative Cache Optimization Algorithm Based on Cournot Game in Fog Computing[J].,2019,29(06):13-17.[doi:10. 3969 / j. issn. 1673-629X. 2019. 06. 003]
点击复制

雾计算中基于古诺博弈的协作缓存优化算法()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
29
期数:
2019年06期
页码:
13-17
栏目:
智能、算法、系统工程
出版日期:
2019-06-10

文章信息/Info

Title:
Cooperative Cache Optimization Algorithm Based on Cournot Game in Fog Computing
文章编号:
1673-629X(2019)06-0013-05
作者:
涂 亮; 徐 雷
南京理工大学 计算机科学与工程学院,江苏 南京 210094
Author(s):
TU Liang; XU Lei
School of Computer Science and Engineering,Nanjing University of Science and Technology,Nanjing 210094,China
关键词:
雾计算; 协作缓存; 时延; 链路代价; 命中率
Keywords:
fog computing; cooperative cache; delay; link cost; hit rate
分类号:
TP301.6
DOI:
10. 3969 / j. issn. 1673-629X. 2019. 06. 003
摘要:
随着移动互联网的快速发展,大批智能移动设备访问互联网资源,造成网络资源请求量的剧增。 当大量用户终端请求网络中的流行内容时,重复传输流行内容,占用大量的带宽资源,造成整个网络拥塞加重。 考虑到雾计算贴近移动终端的特点,充分利用雾服务器节点本身存储容量对用户终端请求进行存储,减少同一内容重复下载,以降低链路消耗。 传统缓存算法并未考虑传输开销、时延等实际因素。 对此,文中提出的基于古诺博弈的链路最小代价协作缓存算法充分考虑到上述实际因素,根据内容的缓存价值来决定内容更新,增加对较流行内容的访问。 通过仿真结果可知,基于古诺博弈的链路最小代价协作缓存算法在链路消耗和缓存命中率的表现明显优于传统缓存算法。
Abstract:
With the rapid development of mobile Internet,a large number of smart mobile devices access to Internet resources,resulting in a dramatic increase in network resource requests. When a large number of user terminals request the popular content in the network,the repeated transmission of popular content takes up a lot of bandwidth resources,resulting in the aggravation of the entire network congestion. Taking into account the characteristics of the fog computing close to the mobile terminal,the storage capacity of the fog server node is fully utilized to store user terminal requests,reducing the repeated downloading of the same content to reduce link consumption. Traditional caching algorithms do not consider the actual factors such as transmission overhead and delay. Therefore,we propose a link minimum cost cooperative cache algorithm based on Cournot game. Taking full account of the actual factors of both,the content update is determined according to the cache value of the content,and the access to more popular content is increased. According to simulation,it can be seen that the performance of the proposed algorithm in link consumption and cache hit rate is obviously better than that of traditional cache algorithm.

相似文献/References:

[1]郑凯月,潘沛生.基于内容流行度和节点重要度的 CCN 缓存策略[J].计算机技术与发展,2018,28(06):73.[doi:10.3969/ j. issn.1673-629X.2018.06.016]
　ZHENG Kai-yue,PAN Pei-sheng.A Caching Scheme Based on Content Popularity and Betweenness in Content Centric Network[J].,2018,28(06):73.[doi:10.3969/ j. issn.1673-629X.2018.06.016]
[2]蒋泉,潘沛生.移动Ad Hoc 网络下协作缓存策略研究[J].计算机技术与发展,2018,28(06):174.[doi:10.3969/ j. issn.1673-629X.2018.06.039]
　JIANG Quan,PAN Pei-sheng.Research on Cooperative Caching Strategy in Mobile Ad Hoc Networks[J].,2018,28(06):174.[doi:10.3969/ j. issn.1673-629X.2018.06.039]
[3]李伟,潘沛生.协作缓存及数学建模在CCN 中的应用[J].计算机技术与发展,2018,28(07):38.[doi:10.3969/ j. issn.1673-629X.2018.07.009]
　LI Wei,PAN Pei-sheng.Application of Cooperative Caching and Mathematical Modeling in CCN[J].,2018,28(06):38.[doi:10.3969/ j. issn.1673-629X.2018.07.009]
[4]葛欣炜,段聪颖,陈思光.基于雾计算的能耗最小化公平计算迁移研究[J].计算机技术与发展,2022,32(03):107.[doi:10. 3969 / j. issn. 1673-629X. 2022. 03. 018]
　GE Xin-wei,DUAN Cong-ying,CHEN Si-guang.Fog Computing Based Energy Minimization and Fair Computation Offloading Mechanism[J].,2022,32(06):107.[doi:10. 3969 / j. issn. 1673-629X. 2022. 03. 018]
[5]鲍春林,宋丽华,余 航.基于节点分层和延迟敏感的服务放置策略[J].计算机技术与发展,2022,32(10):14.[doi:10. 3969 / j. issn. 1673-629X. 2022. 10. 003]
　BAO Chun-lin,SONG Li-hua,YU Hang.Service Placement Policies Based on Node Tiering and Latency Sensitivity[J].,2022,32(06):14.[doi:10. 3969 / j. issn. 1673-629X. 2022. 10. 003]

更新日期/Last Update: 2019-06-10