Edge caching and nearest replica routing in information-centric networking

Feixiong Zhang, Yanyong Zhang, D. Raychaudhuri
{"title":"Edge caching and nearest replica routing in information-centric networking","authors":"Feixiong Zhang, Yanyong Zhang, D. Raychaudhuri","doi":"10.1109/SARNOF.2016.7846751","DOIUrl":null,"url":null,"abstract":"Information-centric networking (ICN) promises to improve content-oriented services by enabling in-network caching and supporting optimal content request forwarding. To achieve this goal, different content caching and request forwarding schemes are proposed in multiple ICN architectures. However, they differ from each other in whether pervasive caching is adopted, and whether nearest-replica routing is supported. In this work, we evaluate these options through extensive simulation over both single domain tree network and multi-domain network scenarios. Our evaluation shows that pervasive caching is not fundamentally better than edge caching; compared with pervasive caching, nearest replica routing brings more benefits, especially in a large network. Based on the observations, we propose a caching system built upon MobilityFirst architecture, in which edge caching is adopted, and nearest replica routing is supported through a global name resolution service. Additional evaluation shows that our proposal retains the advantages of ICN (e.g., requests served from \"best\" location), and is feasible to deploy globally.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 37th Sarnoff Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SARNOF.2016.7846751","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Information-centric networking (ICN) promises to improve content-oriented services by enabling in-network caching and supporting optimal content request forwarding. To achieve this goal, different content caching and request forwarding schemes are proposed in multiple ICN architectures. However, they differ from each other in whether pervasive caching is adopted, and whether nearest-replica routing is supported. In this work, we evaluate these options through extensive simulation over both single domain tree network and multi-domain network scenarios. Our evaluation shows that pervasive caching is not fundamentally better than edge caching; compared with pervasive caching, nearest replica routing brings more benefits, especially in a large network. Based on the observations, we propose a caching system built upon MobilityFirst architecture, in which edge caching is adopted, and nearest replica routing is supported through a global name resolution service. Additional evaluation shows that our proposal retains the advantages of ICN (e.g., requests served from "best" location), and is feasible to deploy globally.
信息中心网络中的边缘缓存和最近副本路由
信息中心网络(ICN)通过启用网络内缓存和支持最佳内容请求转发,有望改进面向内容的服务。为了实现这一目标,在不同的ICN体系结构中提出了不同的内容缓存和请求转发方案。但是,它们在是否采用普遍缓存以及是否支持最近副本路由方面有所不同。在这项工作中,我们通过对单域树网络和多域网络场景的广泛模拟来评估这些选项。我们的评估表明,普适缓存从根本上并不比边缘缓存好;与普遍的缓存相比,最近副本路由带来了更多的好处,特别是在大型网络中。基于观察,我们提出了一种基于MobilityFirst架构的缓存系统,该系统采用边缘缓存,并通过全局名称解析服务支持最近副本路由。额外的评估表明,我们的建议保留了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学术官方微信