面向信息中心网络的内容分层域内协同缓存

Jia Ji, Mingwei Xu, Yuan Yang
{"title":"面向信息中心网络的内容分层域内协同缓存","authors":"Jia Ji, Mingwei Xu, Yuan Yang","doi":"10.1145/2619287.2619289","DOIUrl":null,"url":null,"abstract":"Information-centric networking (ICN) is a clean-slate network architecture to achieve efficient content transmissions. In-network caching is an important issue in ICN, since the routers have a limited caching capacity. Several approaches have been proposed to reduce the cache redundancy, and increase the cache hit ratio and the user delay. Most approaches design algorithms for single routers, and there are still redundant caches in an AS. In this paper, we propose the content-hierarchical Intra-Domain Cooperative Caching (IDCC) scheme to solve the problem, based on the observation that the time of access contents within the local AS is much shorter than that of access contents outside. We use probabilistic caching based on inlet traffic speed, and avoid unnecessary replicas by intra-domain cooperation based on content advertisements. We use hierarchical caching based on content popularity to improve the performance. Our scheme is different from other intra-domain cooperation schemes which remove redundant replicas after contents have been cached. We evaluate our scheme with simulations. The results show that IDCC can improve the hit ratio by 1.7 times and 1.1 times compared to two common existing schemes, respectively.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"185 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Content-hierarchical intra-domain cooperative caching for information-centric networks\",\"authors\":\"Jia Ji, Mingwei Xu, Yuan Yang\",\"doi\":\"10.1145/2619287.2619289\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Information-centric networking (ICN) is a clean-slate network architecture to achieve efficient content transmissions. In-network caching is an important issue in ICN, since the routers have a limited caching capacity. Several approaches have been proposed to reduce the cache redundancy, and increase the cache hit ratio and the user delay. Most approaches design algorithms for single routers, and there are still redundant caches in an AS. In this paper, we propose the content-hierarchical Intra-Domain Cooperative Caching (IDCC) scheme to solve the problem, based on the observation that the time of access contents within the local AS is much shorter than that of access contents outside. We use probabilistic caching based on inlet traffic speed, and avoid unnecessary replicas by intra-domain cooperation based on content advertisements. We use hierarchical caching based on content popularity to improve the performance. Our scheme is different from other intra-domain cooperation schemes which remove redundant replicas after contents have been cached. We evaluate our scheme with simulations. The results show that IDCC can improve the hit ratio by 1.7 times and 1.1 times compared to two common existing schemes, respectively.\",\"PeriodicalId\":409750,\"journal\":{\"name\":\"International Conference of Future Internet\",\"volume\":\"185 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference of Future Internet\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2619287.2619289\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference of Future Internet","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2619287.2619289","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

信息中心网络(ICN)是一种全新的网络体系结构,可实现高效的内容传输。网络内缓存是ICN中的一个重要问题,因为路由器的缓存容量有限。为了减少缓存冗余,提高缓存命中率和用户延迟,提出了几种方法。大多数方法为单个路由器设计算法,并且在自治系统中仍然存在冗余缓存。本文基于对本地自治系统内访问内容的时间比访问外部内容的时间短的观察,提出了内容分层域内协同缓存(IDCC)方案来解决这一问题。我们使用基于入口流量速度的概率缓存,并通过基于内容广告的域内合作来避免不必要的副本。我们使用基于内容流行度的分层缓存来提高性能。我们的方案不同于其他域内协作方案,即在内容缓存后删除冗余副本。我们用模拟来评估我们的方案。结果表明,与现有的两种常用方案相比,IDCC方案的命中率分别提高了1.7倍和1.1倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Content-hierarchical intra-domain cooperative caching for information-centric networks
Information-centric networking (ICN) is a clean-slate network architecture to achieve efficient content transmissions. In-network caching is an important issue in ICN, since the routers have a limited caching capacity. Several approaches have been proposed to reduce the cache redundancy, and increase the cache hit ratio and the user delay. Most approaches design algorithms for single routers, and there are still redundant caches in an AS. In this paper, we propose the content-hierarchical Intra-Domain Cooperative Caching (IDCC) scheme to solve the problem, based on the observation that the time of access contents within the local AS is much shorter than that of access contents outside. We use probabilistic caching based on inlet traffic speed, and avoid unnecessary replicas by intra-domain cooperation based on content advertisements. We use hierarchical caching based on content popularity to improve the performance. Our scheme is different from other intra-domain cooperation schemes which remove redundant replicas after contents have been cached. We evaluate our scheme with simulations. The results show that IDCC can improve the hit ratio by 1.7 times and 1.1 times compared to two common existing schemes, respectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信