EPP-LFU: An Efficient Producer Popularity-based LFU Policy for the Applications of Named-Data Network

Muhammad Burhan, Ahmad Arsalan, R. A. Rehman
{"title":"EPP-LFU: An Efficient Producer Popularity-based LFU Policy for the Applications of Named-Data Network","authors":"Muhammad Burhan, Ahmad Arsalan, R. A. Rehman","doi":"10.1109/INMIC56986.2022.9972919","DOIUrl":null,"url":null,"abstract":"The future Internet architecture, like Named-Data Network (NDN), converts host-based network structures into content-based network structures. Through this transformation, the overall network performance and efficiency are increased. Furthermore, every router in the NDN uses a caching mechanism. Thus, the cache replacement policy used by the NDN routers is also a significant determinant of the NDN's overall performance. Therefore, several types of research have been conducted about the NDN's cache replacement policy. In this article, a light-weighted cache replacement strategy is proposed that overcomes the limitations and drawbacks of the Least Frequently Used (LFU) cache policy. The proposed strategy applies variables, based on real-time producer popularity. Additionally, it can be observed through extensive simulations that the proposed strategy provides better results and shows a higher cache hit ratio as compared to the existing cache policies.","PeriodicalId":404424,"journal":{"name":"2022 24th International Multitopic Conference (INMIC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 24th International Multitopic Conference (INMIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INMIC56986.2022.9972919","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The future Internet architecture, like Named-Data Network (NDN), converts host-based network structures into content-based network structures. Through this transformation, the overall network performance and efficiency are increased. Furthermore, every router in the NDN uses a caching mechanism. Thus, the cache replacement policy used by the NDN routers is also a significant determinant of the NDN's overall performance. Therefore, several types of research have been conducted about the NDN's cache replacement policy. In this article, a light-weighted cache replacement strategy is proposed that overcomes the limitations and drawbacks of the Least Frequently Used (LFU) cache policy. The proposed strategy applies variables, based on real-time producer popularity. Additionally, it can be observed through extensive simulations that the proposed strategy provides better results and shows a higher cache hit ratio as compared to the existing cache policies.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
EPP-LFU:命名数据网络应用中一种高效的基于生产者人气的LFU策略
未来的Internet架构,如命名数据网络(NDN),将基于主机的网络结构转换为基于内容的网络结构。通过这种改造,提高了网络的整体性能和效率。此外,NDN中的每个路由器都使用缓存机制。因此,NDN路由器使用的缓存替换策略也是NDN整体性能的重要决定因素。因此,对NDN的缓存替换策略进行了几种类型的研究。本文提出了一种轻量级缓存替换策略,克服了LFU缓存策略的局限性和缺点。所提出的策略采用基于实时制作人受欢迎程度的变量。此外,通过大量的模拟可以观察到,与现有的缓存策略相比,所提出的策略提供了更好的结果,并且显示出更高的缓存命中率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Recognition of Faces Wearing Masks Using Skip Connection Based Dense Units Augmented With Self Restrained Triplet Loss Enhancing NDVI Calculation of Low-Resolution Imagery using ESRGANs Device Interoperability for Industrial IoT using Model-Driven Architecture Multi-Organ Plant Classification Using Deep Learning A Systematic Review on Fully Automated Online Exam Proctoring Approaches
×
引用
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