Heartbeat: Effective Access to Off-Path Cached Content in NDN

IF 6.7 2区 计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY
Junseok Lee;Dohyung Kim
{"title":"Heartbeat: Effective Access to Off-Path Cached Content in NDN","authors":"Junseok Lee;Dohyung Kim","doi":"10.1109/TNSE.2025.3555743","DOIUrl":null,"url":null,"abstract":"In Information-centric networking(ICN), content is distributed across network caches and accessed using content names instead of location identifiers. This characteristic effectively reduces network costs and latency, but the benefits vary greatly depending on how effectively user requests reach the target content in the cache. Existing literature suggests two approaches for accessing cached content: utilizing replicated requests and exchanging cache catalogs periodically. However, replicated requests can result in redundant data transfer, leading to bandwidth waste. The volatile nature of cached content can render the exchanged cache catalogs outdated, leading to access failure. Moreover, the cache catalog itself can consume a significant amount of bandwidth. To address these issues and implement efficient content access in ICN, we design a novel scheme called <italic>Heartbeat</i>. <italic>Heartbeat</i> disseminates information solely about newly inserted or relocated content with the lifetime carefully calculated, which enables sufficient utilization of cached content while preventing access failures caused by outdated information. We further minimize the overhead of <italic>Heartbeat</i> significantly using several enhancement strategies. Simulation studies conducted on ndnSIM demonstrate that employing <italic>Heartbeat</i> enables 45% more requests to be serviced from network caches, while reducing service latency and bandwidth consumption by up to 11% and 47% respectively, compared to comparative schemes.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"2974-2988"},"PeriodicalIF":6.7000,"publicationDate":"2025-03-28","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/10944575/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

In Information-centric networking(ICN), content is distributed across network caches and accessed using content names instead of location identifiers. This characteristic effectively reduces network costs and latency, but the benefits vary greatly depending on how effectively user requests reach the target content in the cache. Existing literature suggests two approaches for accessing cached content: utilizing replicated requests and exchanging cache catalogs periodically. However, replicated requests can result in redundant data transfer, leading to bandwidth waste. The volatile nature of cached content can render the exchanged cache catalogs outdated, leading to access failure. Moreover, the cache catalog itself can consume a significant amount of bandwidth. To address these issues and implement efficient content access in ICN, we design a novel scheme called Heartbeat. Heartbeat disseminates information solely about newly inserted or relocated content with the lifetime carefully calculated, which enables sufficient utilization of cached content while preventing access failures caused by outdated information. We further minimize the overhead of Heartbeat significantly using several enhancement strategies. Simulation studies conducted on ndnSIM demonstrate that employing Heartbeat enables 45% more requests to be serviced from network caches, while reducing service latency and bandwidth consumption by up to 11% and 47% respectively, compared to comparative schemes.
心跳:在NDN中有效访问非路径缓存内容
在以信息为中心的网络(ICN)中,内容分布在网络缓存中,并使用内容名称而不是位置标识符进行访问。这个特性有效地降低了网络成本和延迟,但是根据用户请求到达缓存中的目标内容的效率不同,好处也有很大的不同。现有文献建议了两种访问缓存内容的方法:利用复制请求和定期交换缓存编目。但是,复制的请求可能导致冗余的数据传输,从而导致带宽浪费。缓存内容的易变特性会使交换的缓存编目过时,从而导致访问失败。此外,缓存编目本身可能会消耗大量带宽。为了解决这些问题并在ICN中实现高效的内容访问,我们设计了一个名为Heartbeat的新方案。Heartbeat仅传播有关新插入或重新定位的内容的信息,并仔细计算了其生命周期,这样可以充分利用缓存的内容,同时防止过时信息导致的访问失败。我们使用几种增强策略进一步显著地减少了Heartbeat的开销。在nnsim上进行的模拟研究表明,与比较方案相比,使用Heartbeat可以从网络缓存中多处理45%的请求,同时将服务延迟和带宽消耗分别减少11%和47%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
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学术文献互助群
群 号:604180095
Book学术官方微信