ProxaDyn:命名数据网络的邻近感知动态缓存方法

IF 6.7 2区 计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY
Matta Krishna Kumari;Nikhil Tripathi;Piyush Joshi
{"title":"ProxaDyn:命名数据网络的邻近感知动态缓存方法","authors":"Matta Krishna Kumari;Nikhil Tripathi;Piyush Joshi","doi":"10.1109/TNSE.2025.3547424","DOIUrl":null,"url":null,"abstract":"Named Data Network (NDN), a future Internet architecture is introduced to address the shortcomings of the current Internet architecture. NDN supports in-network caching to facilitate scalable content distribution and enhance overall network performance. However, the known NDN caching strategies suffer from a few common drawbacks, such as inefficient cache utilization, high content redundancy, and overhead due to lookup repetition. To address these issues, in this paper, we propose a novel caching strategy called ProxaDyn for efficient content lookup, placement, and replacement. During the content lookup phase, ProxaDyn interacts exclusively with the router responsible for caching a particular content. This eliminates interaction with other intermediate routers, thereby significantly reducing content access latency. For content placement, ProxaDyn strategically selects an on-path router based on content popularity. Popular content is placed in the cache of a router closer to the consumer, while less popular content is cached in a router away from the consumer. This approach significantly improves the cache hits and reduces the access latency. We test ProxaDyn over a diverse range of real-world network topologies. Using extensive experiments, we show that ProxaDyn could achieve significantly better results compared to the state-of-the-art NDN caching strategies.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 3","pages":"2360-2372"},"PeriodicalIF":6.7000,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ProxaDyn: A Proximity-Aware Dynamic Caching Approach for Named Data Networks\",\"authors\":\"Matta Krishna Kumari;Nikhil Tripathi;Piyush Joshi\",\"doi\":\"10.1109/TNSE.2025.3547424\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Named Data Network (NDN), a future Internet architecture is introduced to address the shortcomings of the current Internet architecture. NDN supports in-network caching to facilitate scalable content distribution and enhance overall network performance. However, the known NDN caching strategies suffer from a few common drawbacks, such as inefficient cache utilization, high content redundancy, and overhead due to lookup repetition. To address these issues, in this paper, we propose a novel caching strategy called ProxaDyn for efficient content lookup, placement, and replacement. During the content lookup phase, ProxaDyn interacts exclusively with the router responsible for caching a particular content. This eliminates interaction with other intermediate routers, thereby significantly reducing content access latency. For content placement, ProxaDyn strategically selects an on-path router based on content popularity. Popular content is placed in the cache of a router closer to the consumer, while less popular content is cached in a router away from the consumer. This approach significantly improves the cache hits and reduces the access latency. We test ProxaDyn over a diverse range of real-world network topologies. Using extensive experiments, we show that ProxaDyn could achieve significantly better results compared to the state-of-the-art NDN caching strategies.\",\"PeriodicalId\":54229,\"journal\":{\"name\":\"IEEE Transactions on Network Science and Engineering\",\"volume\":\"12 3\",\"pages\":\"2360-2372\"},\"PeriodicalIF\":6.7000,\"publicationDate\":\"2025-03-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network Science and Engineering\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10909575/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10909575/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

数据网络(Data Network, NDN)是一种未来的互联网架构,旨在解决当前互联网架构的不足。NDN支持网络内缓存,以促进可扩展的内容分发并增强整体网络性能。然而,已知的NDN缓存策略存在一些常见的缺点,例如缓存利用率低、内容冗余高以及查找重复造成的开销。为了解决这些问题,在本文中,我们提出了一种新的缓存策略,称为ProxaDyn,用于高效的内容查找、放置和替换。在内容查找阶段,ProxaDyn只与负责缓存特定内容的路由器交互。这消除了与其他中间路由器的交互,从而大大减少了内容访问延迟。对于内容放置,ProxaDyn根据内容的受欢迎程度策略性地选择路径上的路由器。受欢迎的内容放在离消费者较近的路由器的缓存中,而不太受欢迎的内容缓存在离消费者较远的路由器中。这种方法显著提高了缓存命中率并减少了访问延迟。我们在各种实际网络拓扑结构上测试ProxaDyn。通过大量的实验,我们表明ProxaDyn与最先进的NDN缓存策略相比可以获得更好的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
ProxaDyn: A Proximity-Aware Dynamic Caching Approach for Named Data Networks
Named Data Network (NDN), a future Internet architecture is introduced to address the shortcomings of the current Internet architecture. NDN supports in-network caching to facilitate scalable content distribution and enhance overall network performance. However, the known NDN caching strategies suffer from a few common drawbacks, such as inefficient cache utilization, high content redundancy, and overhead due to lookup repetition. To address these issues, in this paper, we propose a novel caching strategy called ProxaDyn for efficient content lookup, placement, and replacement. During the content lookup phase, ProxaDyn interacts exclusively with the router responsible for caching a particular content. This eliminates interaction with other intermediate routers, thereby significantly reducing content access latency. For content placement, ProxaDyn strategically selects an on-path router based on content popularity. Popular content is placed in the cache of a router closer to the consumer, while less popular content is cached in a router away from the consumer. This approach significantly improves the cache hits and reduces the access latency. We test ProxaDyn over a diverse range of real-world network topologies. Using extensive experiments, we show that ProxaDyn could achieve significantly better results compared to the state-of-the-art NDN caching strategies.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Network Science and Engineering
IEEE Transactions on Network Science and Engineering Engineering-Control and Systems Engineering
CiteScore
12.60
自引率
9.10%
发文量
393
期刊介绍: The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.
×
引用
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学术官方微信