SmartFIB:用于大名称空间转发的低替换路由存储

Dinh Nguyen, H. Asaeda
{"title":"SmartFIB:用于大名称空间转发的低替换路由存储","authors":"Dinh Nguyen, H. Asaeda","doi":"10.1109/CCNC46108.2020.9045738","DOIUrl":null,"url":null,"abstract":"We revisit route caching in information-centric networking and propose SmartFIB, a tandem route storage design for dealing with the name forwarding table scalability problem. The proposed route storage not only can quickly adapt to traffic pattern to retain the most frequently referred name prefixes but also is hardware-friendly thanks to its exceptionally low replacement rate. The low replacement, moreover, reduces route lookup rates in settings where centralized name resolution service or scoped route discovery is deployed. Our scheme is lightweight, can enhance route hit rate of small-size fast-memory forwarding information base (FIB), and most remarkably is able to reduce route replacement multiple folds. Evaluated in real-topology networks under a wide variety of parameter settings, the proposed route storage can increase hit rate by 27% compared with a conventional route cache especially with a tiny FIB size, four orders of magnitude smaller than the name prefix space, and more importantly, it can lower route replacement more than 7 times. The results suggest that our proposed scheme is a viable technique to complement route caching in dealing with the name forwarding table scalability problem.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SmartFIB: Low-Replacement Route Storage for Large Name Space Forwarding\",\"authors\":\"Dinh Nguyen, H. Asaeda\",\"doi\":\"10.1109/CCNC46108.2020.9045738\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We revisit route caching in information-centric networking and propose SmartFIB, a tandem route storage design for dealing with the name forwarding table scalability problem. The proposed route storage not only can quickly adapt to traffic pattern to retain the most frequently referred name prefixes but also is hardware-friendly thanks to its exceptionally low replacement rate. The low replacement, moreover, reduces route lookup rates in settings where centralized name resolution service or scoped route discovery is deployed. Our scheme is lightweight, can enhance route hit rate of small-size fast-memory forwarding information base (FIB), and most remarkably is able to reduce route replacement multiple folds. Evaluated in real-topology networks under a wide variety of parameter settings, the proposed route storage can increase hit rate by 27% compared with a conventional route cache especially with a tiny FIB size, four orders of magnitude smaller than the name prefix space, and more importantly, it can lower route replacement more than 7 times. The results suggest that our proposed scheme is a viable technique to complement route caching in dealing with the name forwarding table scalability problem.\",\"PeriodicalId\":443862,\"journal\":{\"name\":\"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCNC46108.2020.9045738\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC46108.2020.9045738","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们重新研究了以信息为中心的网络中的路由缓存,并提出了一种用于处理名称转发表可扩展性问题的串联路由存储设计SmartFIB。所提出的路由存储不仅可以快速适应流量模式,保留最常被引用的名称前缀,而且由于其极低的替换率,硬件友好。此外,在部署集中式名称解析服务或范围路由发现的设置中,低替换率降低了路由查找速率。该方案重量轻,可以提高小容量快速存储转发信息库(FIB)的路由命中率,最显著的是可以将路由替换率降低几倍。在多种参数设置的实际拓扑网络中进行了评估,与传统路由缓存相比,所提出的路由存储可以提高27%的命中率,特别是在FIB大小很小的情况下,比名称前缀空间小4个数量级,更重要的是,它可以将路由替换率降低7倍以上。结果表明,我们提出的方案是一种可行的技术,以补充路由缓存,以处理名称转发表的可扩展性问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
SmartFIB: Low-Replacement Route Storage for Large Name Space Forwarding
We revisit route caching in information-centric networking and propose SmartFIB, a tandem route storage design for dealing with the name forwarding table scalability problem. The proposed route storage not only can quickly adapt to traffic pattern to retain the most frequently referred name prefixes but also is hardware-friendly thanks to its exceptionally low replacement rate. The low replacement, moreover, reduces route lookup rates in settings where centralized name resolution service or scoped route discovery is deployed. Our scheme is lightweight, can enhance route hit rate of small-size fast-memory forwarding information base (FIB), and most remarkably is able to reduce route replacement multiple folds. Evaluated in real-topology networks under a wide variety of parameter settings, the proposed route storage can increase hit rate by 27% compared with a conventional route cache especially with a tiny FIB size, four orders of magnitude smaller than the name prefix space, and more importantly, it can lower route replacement more than 7 times. The results suggest that our proposed scheme is a viable technique to complement route caching in dealing with the name forwarding table scalability problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信