信息中心网络的两层缓存方案

Kelvin H. T. Chiu, Jason Min Wang, A. Abdelmoniem, B. Bensaou
{"title":"信息中心网络的两层缓存方案","authors":"Kelvin H. T. Chiu, Jason Min Wang, A. Abdelmoniem, B. Bensaou","doi":"10.1109/HPSR52026.2021.9481839","DOIUrl":null,"url":null,"abstract":"In information centric networking (ICN), by default, forwarder nodes along the paths from content producers to consumers, cache and reuse content chunks ubiquitously, invoking the Least Recently Used (LRU) replacement policy when needed. Due to the cache filtering effect, this ubiquitous-LRU strategy is inefficient: popular contents that are cached a few hops away from the edge are of little utility. Most alternative proposals adopt unified on-path schemes that rely on popularity statistics or other global state information to improve the performance. In the Internet, it is difficult to imagine different administrative-entities exposing such information to each other, and so we argue that such schemes are not realistic; and secondly, a unified caching scheme across the network ignores the administrative autonomy, which is one of the tenets of the Internet. In this paper we argue for a two-tiered caching scheme that maintains an on-path caching scheme (e.g., Ubiquitous-LRU), yet embraces AS-autonomy by adding within the AS an off-path cooperative-caching and redundancy elimination, to make better use of caches in the edge where they are most valuable. We describe the implementation of our scheme and highlight the design choices to make the system practical. Our evaluation results show that our scheme can reduce cache misses and upstream traffic by up to 15% compared to the state-of-the-art.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Two-tiered Caching Scheme for Information-Centric Networks\",\"authors\":\"Kelvin H. T. Chiu, Jason Min Wang, A. Abdelmoniem, B. Bensaou\",\"doi\":\"10.1109/HPSR52026.2021.9481839\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In information centric networking (ICN), by default, forwarder nodes along the paths from content producers to consumers, cache and reuse content chunks ubiquitously, invoking the Least Recently Used (LRU) replacement policy when needed. Due to the cache filtering effect, this ubiquitous-LRU strategy is inefficient: popular contents that are cached a few hops away from the edge are of little utility. Most alternative proposals adopt unified on-path schemes that rely on popularity statistics or other global state information to improve the performance. In the Internet, it is difficult to imagine different administrative-entities exposing such information to each other, and so we argue that such schemes are not realistic; and secondly, a unified caching scheme across the network ignores the administrative autonomy, which is one of the tenets of the Internet. In this paper we argue for a two-tiered caching scheme that maintains an on-path caching scheme (e.g., Ubiquitous-LRU), yet embraces AS-autonomy by adding within the AS an off-path cooperative-caching and redundancy elimination, to make better use of caches in the edge where they are most valuable. We describe the implementation of our scheme and highlight the design choices to make the system practical. Our evaluation results show that our scheme can reduce cache misses and upstream traffic by up to 15% compared to the state-of-the-art.\",\"PeriodicalId\":158580,\"journal\":{\"name\":\"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR52026.2021.9481839\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR52026.2021.9481839","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在信息中心网络(ICN)中,默认情况下,转发器节点沿着从内容生产者到消费者的路径,无处不在地缓存和重用内容块,在需要时调用最近最少使用(LRU)替换策略。由于缓存过滤效应,这种无处不在的lru策略是低效的:在距离边缘几跳的地方缓存的流行内容几乎没有什么用处。大多数替代方案采用统一的路径方案,依赖于人气统计或其他全局状态信息来提高性能。在互联网上,很难想象不同的管理实体相互暴露这样的信息,因此我们认为这样的方案是不现实的;其次,跨网络的统一缓存方案忽略了管理自治,这是互联网的原则之一。在本文中,我们论证了一种两层缓存方案,该方案维护了路径上的缓存方案(例如,Ubiquitous-LRU),但通过在AS中添加路径外的协同缓存和冗余消除来支持AS自治,以便更好地利用边缘缓存,因为它们最有价值。我们描述了我们的方案的实现,并强调了设计选择,使系统具有实用性。我们的评估结果表明,与最先进的方案相比,我们的方案可以减少多达15%的缓存丢失和上游流量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Two-tiered Caching Scheme for Information-Centric Networks
In information centric networking (ICN), by default, forwarder nodes along the paths from content producers to consumers, cache and reuse content chunks ubiquitously, invoking the Least Recently Used (LRU) replacement policy when needed. Due to the cache filtering effect, this ubiquitous-LRU strategy is inefficient: popular contents that are cached a few hops away from the edge are of little utility. Most alternative proposals adopt unified on-path schemes that rely on popularity statistics or other global state information to improve the performance. In the Internet, it is difficult to imagine different administrative-entities exposing such information to each other, and so we argue that such schemes are not realistic; and secondly, a unified caching scheme across the network ignores the administrative autonomy, which is one of the tenets of the Internet. In this paper we argue for a two-tiered caching scheme that maintains an on-path caching scheme (e.g., Ubiquitous-LRU), yet embraces AS-autonomy by adding within the AS an off-path cooperative-caching and redundancy elimination, to make better use of caches in the edge where they are most valuable. We describe the implementation of our scheme and highlight the design choices to make the system practical. Our evaluation results show that our scheme can reduce cache misses and upstream traffic by up to 15% compared to the state-of-the-art.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信