车载内容中心网络(VCCN)中具有内容流行度的缓存替换机制

Sangduan Chootong, Jirawat Thaenthong
{"title":"车载内容中心网络(VCCN)中具有内容流行度的缓存替换机制","authors":"Sangduan Chootong, Jirawat Thaenthong","doi":"10.1109/JCSSE.2017.8025901","DOIUrl":null,"url":null,"abstract":"Caching mechanism is usually used in Content-Centric Networking. Cache data is contained at provider node and all nodes along the path to the consumer node. The disadvantage of this mechanism is the data redundancy on several nodes. In the case of the cache size is limited, the cache hit of the request data is issued. In this paper proposed a Cache Replacement with Content Popularity (CRCP) mechanism that allows a node in a cluster of vehicles to make decision retaining data or performing cache replacement. The results demonstrate the performance of the proposed mechanism is better than the LFU and LRU in terms of average cache hit ratio.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"271 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Cache replacement mechanism with Content Popularity for Vehicular Content-Centric Networks (VCCN)\",\"authors\":\"Sangduan Chootong, Jirawat Thaenthong\",\"doi\":\"10.1109/JCSSE.2017.8025901\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Caching mechanism is usually used in Content-Centric Networking. Cache data is contained at provider node and all nodes along the path to the consumer node. The disadvantage of this mechanism is the data redundancy on several nodes. In the case of the cache size is limited, the cache hit of the request data is issued. In this paper proposed a Cache Replacement with Content Popularity (CRCP) mechanism that allows a node in a cluster of vehicles to make decision retaining data or performing cache replacement. The results demonstrate the performance of the proposed mechanism is better than the LFU and LRU in terms of average cache hit ratio.\",\"PeriodicalId\":6460,\"journal\":{\"name\":\"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"volume\":\"271 1\",\"pages\":\"1-6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JCSSE.2017.8025901\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCSSE.2017.8025901","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

缓存机制通常用于以内容为中心的网络。缓存数据包含在提供者节点和到使用者节点路径上的所有节点上。这种机制的缺点是多个节点上的数据冗余。在缓存大小有限的情况下,发出请求数据的缓存命中。本文提出了一种基于内容流行度的缓存替换(CRCP)机制,该机制允许车辆集群中的节点做出保留数据或执行缓存替换的决策。结果表明,该机制在平均缓存命中率方面优于LFU和LRU。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Cache replacement mechanism with Content Popularity for Vehicular Content-Centric Networks (VCCN)
Caching mechanism is usually used in Content-Centric Networking. Cache data is contained at provider node and all nodes along the path to the consumer node. The disadvantage of this mechanism is the data redundancy on several nodes. In the case of the cache size is limited, the cache hit of the request data is issued. In this paper proposed a Cache Replacement with Content Popularity (CRCP) mechanism that allows a node in a cluster of vehicles to make decision retaining data or performing cache replacement. The results demonstrate the performance of the proposed mechanism is better than the LFU and LRU in terms of average cache hit ratio.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Isolate-Set-Based In-Memory Parallel Subgraph Matching Framework A Fast Attitude Estimation Method Using Homography Matrix IOT for smart farm: A case study of the Lingzhi mushroom farm at Maejo University Analyzing user reviews in Thai language toward aspects in mobile applications Front-rear crossover: A new crossover technique for solving a trap problem
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1