网络处理器的高效前缀缓存

M. Akhbarizadeh, M. Nourani
{"title":"网络处理器的高效前缀缓存","authors":"M. Akhbarizadeh, M. Nourani","doi":"10.1109/CONECT.2004.1375199","DOIUrl":null,"url":null,"abstract":"Conventional routing cache systems store destination IP addresses in their cache directory. We present a routing cache technique that stores the most recently used route prefixes, instead of IP addresses, to achieve a significantly smaller cache size. A nesting prefix is partially represented in this cache by its minimal expansions. Such expanded prefixes are obtained using an incremental technique without any modifications to the routing table. Consequently, our cache works with most of the common route lookup algorithms and efficiently maintains coherency with the routing table. Experiments show that, for a hit ratio over 0.96, our design can achieve more than 33 times reduction in cache size, compared to a conventional routing cache.","PeriodicalId":224195,"journal":{"name":"Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"45","resultStr":"{\"title\":\"Efficient prefix cache for network processors\",\"authors\":\"M. Akhbarizadeh, M. Nourani\",\"doi\":\"10.1109/CONECT.2004.1375199\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Conventional routing cache systems store destination IP addresses in their cache directory. We present a routing cache technique that stores the most recently used route prefixes, instead of IP addresses, to achieve a significantly smaller cache size. A nesting prefix is partially represented in this cache by its minimal expansions. Such expanded prefixes are obtained using an incremental technique without any modifications to the routing table. Consequently, our cache works with most of the common route lookup algorithms and efficiently maintains coherency with the routing table. Experiments show that, for a hit ratio over 0.96, our design can achieve more than 33 times reduction in cache size, compared to a conventional routing cache.\",\"PeriodicalId\":224195,\"journal\":{\"name\":\"Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-08-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"45\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CONECT.2004.1375199\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONECT.2004.1375199","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 45

摘要

传统的路由缓存系统将目标IP地址存储在它们的缓存目录中。我们提出了一种路由缓存技术,该技术存储最近使用的路由前缀,而不是IP地址,以实现更小的缓存大小。嵌套前缀在此缓存中通过其最小扩展部分表示。这种扩展的前缀是使用增量技术获得的,不需要对路由表进行任何修改。因此,我们的缓存可以与大多数常见的路由查找算法一起工作,并有效地保持与路由表的一致性。实验表明,在命中率超过0.96的情况下,与传统路由缓存相比,我们的设计可以将缓存大小减少33倍以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient prefix cache for network processors
Conventional routing cache systems store destination IP addresses in their cache directory. We present a routing cache technique that stores the most recently used route prefixes, instead of IP addresses, to achieve a significantly smaller cache size. A nesting prefix is partially represented in this cache by its minimal expansions. Such expanded prefixes are obtained using an incremental technique without any modifications to the routing table. Consequently, our cache works with most of the common route lookup algorithms and efficiently maintains coherency with the routing table. Experiments show that, for a hit ratio over 0.96, our design can achieve more than 33 times reduction in cache size, compared to a conventional routing cache.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信