Less pain, most of the gain: incrementally deployable ICN

S. K. Fayazbakhsh, Yin Lin, Amin Tootoonchian, A. Ghodsi, Teemu Koponen, B. Maggs, Keung-Chi Ng, V. Sekar, S. Shenker
{"title":"Less pain, most of the gain: incrementally deployable ICN","authors":"S. K. Fayazbakhsh, Yin Lin, Amin Tootoonchian, A. Ghodsi, Teemu Koponen, B. Maggs, Keung-Chi Ng, V. Sekar, S. Shenker","doi":"10.1145/2486001.2486023","DOIUrl":null,"url":null,"abstract":"Information-Centric Networking (ICN) has seen a significant resurgence in recent years. ICN promises benefits to users and service providers along several dimensions (e.g., performance, security, and mobility). These benefits, however, come at a non-trivial cost as many ICN proposals envision adding significant complexity to the network by having routers serve as content caches and support nearest-replica routing. This paper is driven by the simple question of whether this additional complexity is justified and if we can achieve these benefits in an incrementally deployable fashion. To this end, we use trace-driven simulations to analyze the quantitative benefits attributed to ICN (e.g., lower latency and congestion). Somewhat surprisingly, we find that pervasive caching and nearest-replica routing are not fundamentally necessary---most of the performance benefits can be achieved with simpler caching architectures. We also discuss how the qualitative benefits of ICN (e.g., security, mobility) can be achieved without any changes to the network. Building on these insights, we present a proof-of-concept design of an incrementally deployable ICN architecture.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"263 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"379","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2486001.2486023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 379

Abstract

Information-Centric Networking (ICN) has seen a significant resurgence in recent years. ICN promises benefits to users and service providers along several dimensions (e.g., performance, security, and mobility). These benefits, however, come at a non-trivial cost as many ICN proposals envision adding significant complexity to the network by having routers serve as content caches and support nearest-replica routing. This paper is driven by the simple question of whether this additional complexity is justified and if we can achieve these benefits in an incrementally deployable fashion. To this end, we use trace-driven simulations to analyze the quantitative benefits attributed to ICN (e.g., lower latency and congestion). Somewhat surprisingly, we find that pervasive caching and nearest-replica routing are not fundamentally necessary---most of the performance benefits can be achieved with simpler caching architectures. We also discuss how the qualitative benefits of ICN (e.g., security, mobility) can be achieved without any changes to the network. Building on these insights, we present a proof-of-concept design of an incrementally deployable ICN architecture.
更少的痛苦,更多的收获:增量部署ICN
近年来,以信息为中心的网络(ICN)出现了显著的复苏。ICN承诺在几个方面为用户和服务提供商带来好处(例如,性能、安全性和移动性)。然而,这些好处带来了不小的代价,因为许多ICN提案设想通过让路由器充当内容缓存并支持最近副本路由来增加网络的显著复杂性。这篇文章是由这样一个简单的问题驱动的:这种额外的复杂性是否合理,以及我们是否能够以增量部署的方式实现这些好处。为此,我们使用跟踪驱动的模拟来分析ICN的量化优势(例如,更低的延迟和拥塞)。有些令人惊讶的是,我们发现普及缓存和最近副本路由从根本上来说并不是必需的——大多数性能优势可以通过更简单的缓存架构来实现。我们还讨论了如何在不改变网络的情况下实现ICN的定性优势(例如,安全性,移动性)。基于这些见解,我们提出了一个增量部署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学术文献互助群
群 号:481959085
Book学术官方微信