基于隐马尔可夫模型的车载内容中心网络人气预测缓存

Lin Yao, Yuqi Wang, Qiufen Xia, Rui Xu
{"title":"基于隐马尔可夫模型的车载内容中心网络人气预测缓存","authors":"Lin Yao, Yuqi Wang, Qiufen Xia, Rui Xu","doi":"10.1109/MDM.2019.00115","DOIUrl":null,"url":null,"abstract":"Vehicular Content Centric Network (VCCN) is proposed to cope with mobility and intermittent connectivity issues of vehicular ad hoc networks by enabling the Content Centric Network (CCN) model in vehicular networks. The ubiquitous in-network caching of VCCN allows nodes to cache contents frequently accessed data items, improving the hit ratio of content retrieval and reducing the data access delay. Furthermore, it can significantly mitigate bandwidth pressure. Therefore, it is crucial to cache more popular contents at various caching nodes. In this paper, we propose a novel cache replacement scheme named Popularity-based Content Caching (PopCC), which incorporates the future popularity of contents into our decision making. We adopt Hidden Markov Model (HMM) to predict the content popularity based on the inherent characters of the received interests, request ratio, request frequency and content priority. To evaluate the performance of our proposed scheme PopCC, we compare it with some state-of-the-art schemes in terms of cache hit, average access delay, average hop count and average storage usage. Simulations demonstrate that the proposed scheme possesses a better performance.","PeriodicalId":241426,"journal":{"name":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Popularity Prediction Caching Using Hidden Markov Model for Vehicular Content Centric Networks\",\"authors\":\"Lin Yao, Yuqi Wang, Qiufen Xia, Rui Xu\",\"doi\":\"10.1109/MDM.2019.00115\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicular Content Centric Network (VCCN) is proposed to cope with mobility and intermittent connectivity issues of vehicular ad hoc networks by enabling the Content Centric Network (CCN) model in vehicular networks. The ubiquitous in-network caching of VCCN allows nodes to cache contents frequently accessed data items, improving the hit ratio of content retrieval and reducing the data access delay. Furthermore, it can significantly mitigate bandwidth pressure. Therefore, it is crucial to cache more popular contents at various caching nodes. In this paper, we propose a novel cache replacement scheme named Popularity-based Content Caching (PopCC), which incorporates the future popularity of contents into our decision making. We adopt Hidden Markov Model (HMM) to predict the content popularity based on the inherent characters of the received interests, request ratio, request frequency and content priority. To evaluate the performance of our proposed scheme PopCC, we compare it with some state-of-the-art schemes in terms of cache hit, average access delay, average hop count and average storage usage. Simulations demonstrate that the proposed scheme possesses a better performance.\",\"PeriodicalId\":241426,\"journal\":{\"name\":\"2019 20th IEEE International Conference on Mobile Data Management (MDM)\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 20th IEEE International Conference on Mobile Data Management (MDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MDM.2019.00115\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MDM.2019.00115","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

车辆内容中心网络(VCCN)通过在车辆网络中启用内容中心网络(CCN)模型来解决车辆自组织网络的移动性和间歇性连接问题。无处不在的VCCN网络内缓存允许节点缓存频繁访问的数据项内容,提高内容检索的命中率,减少数据访问延迟。此外,它可以显著减轻带宽压力。因此,在不同的缓存节点上缓存更流行的内容是至关重要的。在本文中,我们提出了一种新的缓存替换方案,即基于流行度的内容缓存(PopCC),该方案将内容的未来流行度纳入我们的决策中。基于收到的兴趣、请求比例、请求频率和内容优先级的固有特征,采用隐马尔可夫模型(HMM)预测内容流行度。为了评估我们提出的方案PopCC的性能,我们将其与一些最先进的方案在缓存命中、平均访问延迟、平均跳数和平均存储使用量方面进行了比较。仿真结果表明,该方案具有较好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Popularity Prediction Caching Using Hidden Markov Model for Vehicular Content Centric Networks
Vehicular Content Centric Network (VCCN) is proposed to cope with mobility and intermittent connectivity issues of vehicular ad hoc networks by enabling the Content Centric Network (CCN) model in vehicular networks. The ubiquitous in-network caching of VCCN allows nodes to cache contents frequently accessed data items, improving the hit ratio of content retrieval and reducing the data access delay. Furthermore, it can significantly mitigate bandwidth pressure. Therefore, it is crucial to cache more popular contents at various caching nodes. In this paper, we propose a novel cache replacement scheme named Popularity-based Content Caching (PopCC), which incorporates the future popularity of contents into our decision making. We adopt Hidden Markov Model (HMM) to predict the content popularity based on the inherent characters of the received interests, request ratio, request frequency and content priority. To evaluate the performance of our proposed scheme PopCC, we compare it with some state-of-the-art schemes in terms of cache hit, average access delay, average hop count and average storage usage. Simulations demonstrate that the proposed scheme possesses a better performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信