Efficient Distance based Response Time Pruning Cache Policy for NDN

Ahmad Arsalan, Muhammad Burhan, R. A. Rehman
{"title":"Efficient Distance based Response Time Pruning Cache Policy for NDN","authors":"Ahmad Arsalan, Muhammad Burhan, R. A. Rehman","doi":"10.1109/FIT57066.2022.00038","DOIUrl":null,"url":null,"abstract":"In today’s world, usage of the Internet is growing day by day. The contents that can be accessed with a single swipe of a finger are growing and changing. However, the present network is designed in such a way that it is impossible to respond quickly to content overflow issues. When numerous users make extensive requests for content, the bottleneck problem emerges. The Named Data Network (NDN) has emerged as a viable option for future networks to address this issue. NDN is an emerging paradigm that follows content-based communication rather than IP addresses. NDN effectively utilizes network capacity by employing a caching function at the intermediate nodes of the network to enhance network efficiency. Doing this minimizes network response time and increases the network cache hit ratio. In such a context, we suggest an NDN-based cache strategy that can increase network efficiency. The proposed scheme is evaluated through simulations which show better results as compared to native NDN cache policies in terms of response time and hit ratio.","PeriodicalId":102958,"journal":{"name":"2022 International Conference on Frontiers of Information Technology (FIT)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Frontiers of Information Technology (FIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FIT57066.2022.00038","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In today’s world, usage of the Internet is growing day by day. The contents that can be accessed with a single swipe of a finger are growing and changing. However, the present network is designed in such a way that it is impossible to respond quickly to content overflow issues. When numerous users make extensive requests for content, the bottleneck problem emerges. The Named Data Network (NDN) has emerged as a viable option for future networks to address this issue. NDN is an emerging paradigm that follows content-based communication rather than IP addresses. NDN effectively utilizes network capacity by employing a caching function at the intermediate nodes of the network to enhance network efficiency. Doing this minimizes network response time and increases the network cache hit ratio. In such a context, we suggest an NDN-based cache strategy that can increase network efficiency. The proposed scheme is evaluated through simulations which show better results as compared to native NDN cache policies in terms of response time and hit ratio.
基于有效距离的NDN响应时间剪枝缓存策略
在当今世界,互联网的使用日益增长。手指一扫就能访问的内容正在不断增长和变化。然而,目前的网络设计是这样一种方式,它是不可能快速响应内容溢出问题。当大量用户对内容提出大量请求时,瓶颈问题就出现了。命名数据网络(NDN)已经成为未来网络解决这一问题的可行选择。NDN是一种新兴的范例,它遵循基于内容的通信而不是IP地址。NDN通过在网络中间节点使用缓存功能,有效地利用了网络容量,提高了网络效率。这样做可以最小化网络响应时间并提高网络缓存命中率。在这种情况下,我们建议采用基于ndn的缓存策略来提高网络效率。仿真结果表明,该方案在响应时间和命中率方面优于原生NDN缓存策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信