On-path collaborative in-network caching for information-centric networks

Lemei Huang, Yu Guan, Xinggong Zhang, Zongming Guo
{"title":"On-path collaborative in-network caching for information-centric networks","authors":"Lemei Huang, Yu Guan, Xinggong Zhang, Zongming Guo","doi":"10.1109/INFCOMW.2017.8116372","DOIUrl":null,"url":null,"abstract":"It is a challenge for Information-Centric Network (ICN) that how to maximize the utilization of network-embedded cache. On-path collaboration is an efficient way to reduce access latency and cache redundancy. All nodes on ICN routing path work together to achieve higher performance than individual cache, and lower collaboration overhead than regional collaborative cache. In this paper, we formulate the traffic cost minimization problem in on-path collaborative caching, and give some insights of it. A caching utility function is defined with respect to content popularity and distance to content cache or source, in order to evaluate the payoff of caching an item at one of the on-path collaborative nodes. An on-path collaborative caching scheme UtilCache is proposed, which keeps ICN cache decision procedure unchanged but replaces items by the proposed policy LCU (Least Caching Utility). LCU evicts the items with least caching utility calculated by the caching utility function. The collaborative messages are piggybacked by data packets with low communication overhead. Compared with state-of-the-art caching schemes, UtilCache yields better performance in cache hit ratio, low latency and low communication overhead. The experimental results demonstrate that the proposed UtilCache achieves up to 50% latency reduction compared with individual caching, and less overhead compared with other collaborative caching. It also validates the implementation of UtilCache is very easy to be seamlessly integrated in current ICN framework.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2017.8116372","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

It is a challenge for Information-Centric Network (ICN) that how to maximize the utilization of network-embedded cache. On-path collaboration is an efficient way to reduce access latency and cache redundancy. All nodes on ICN routing path work together to achieve higher performance than individual cache, and lower collaboration overhead than regional collaborative cache. In this paper, we formulate the traffic cost minimization problem in on-path collaborative caching, and give some insights of it. A caching utility function is defined with respect to content popularity and distance to content cache or source, in order to evaluate the payoff of caching an item at one of the on-path collaborative nodes. An on-path collaborative caching scheme UtilCache is proposed, which keeps ICN cache decision procedure unchanged but replaces items by the proposed policy LCU (Least Caching Utility). LCU evicts the items with least caching utility calculated by the caching utility function. The collaborative messages are piggybacked by data packets with low communication overhead. Compared with state-of-the-art caching schemes, UtilCache yields better performance in cache hit ratio, low latency and low communication overhead. The experimental results demonstrate that the proposed UtilCache achieves up to 50% latency reduction compared with individual caching, and less overhead compared with other collaborative caching. It also validates the implementation of UtilCache is very easy to be seamlessly integrated in current ICN framework.
用于信息中心网络的路径上协同网络内缓存
如何最大限度地利用网络嵌入式缓存是当前信息中心网络(ICN)面临的一个挑战。路径上协作是减少访问延迟和缓存冗余的有效方法。ICN路由路径上的所有节点协同工作,实现了比单个缓存更高的性能和比区域协作缓存更低的协作开销。本文提出了路径上协同缓存中的流量成本最小化问题,并给出了一些见解。根据内容流行度和到内容缓存或源的距离定义缓存实用程序函数,以便评估在路径上协作节点之一缓存项的收益。提出了一种基于路径的协同缓存方案UtilCache,该方案在保持ICN缓存决策过程不变的同时,用所提出的策略LCU (Least caching Utility)代替条目。LCU将由缓存实用程序函数计算出的缓存实用程序最小的项驱逐出去。协作消息由数据包承载,具有较低的通信开销。与最先进的缓存方案相比,UtilCache在缓存命中率、低延迟和低通信开销方面具有更好的性能。实验结果表明,与单独缓存相比,所提出的UtilCache实现了高达50%的延迟减少,并且与其他协作缓存相比,开销更小。这也验证了UtilCache的实现非常容易与当前的ICN框架无缝集成。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信