Efficient IP routing table VLSI design for multigigabit routers

R. Chang, B. Lim
{"title":"Efficient IP routing table VLSI design for multigigabit routers","authors":"R. Chang, B. Lim","doi":"10.1109/ISCAS.2002.1011468","DOIUrl":null,"url":null,"abstract":"The routing table lookup becomes a great bottleneck when multi-gigabit links are required in today's network routers. Hence, we propose a lookup scheme that can efficiently handle IP routing lookup, insertion and deletion inside the routing table. By introducing memory reduction and the novel skip function, we have successfully reduced the required memory size to about 0.59 Mbytes. The routing table VLSI design was carried out. It can achieve one route lookup for every memory access using pipeline implementation. Timemill post-layout simulation results show that the chip can furnish approximately 30/spl times/10/sup 6/ lookups/s, and thus it can support up to 30 Gbits/s link speed when the frame size is 1000 bits. In addition, our design can be easily scaled from IPv4 to IPv6.","PeriodicalId":203750,"journal":{"name":"2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCAS.2002.1011468","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The routing table lookup becomes a great bottleneck when multi-gigabit links are required in today's network routers. Hence, we propose a lookup scheme that can efficiently handle IP routing lookup, insertion and deletion inside the routing table. By introducing memory reduction and the novel skip function, we have successfully reduced the required memory size to about 0.59 Mbytes. The routing table VLSI design was carried out. It can achieve one route lookup for every memory access using pipeline implementation. Timemill post-layout simulation results show that the chip can furnish approximately 30/spl times/10/sup 6/ lookups/s, and thus it can support up to 30 Gbits/s link speed when the frame size is 1000 bits. In addition, our design can be easily scaled from IPv4 to IPv6.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多千兆路由器的高效IP路由表VLSI设计
在当前的网络路由器中,当需要多千兆链路时,路由表查找成为一个很大的瓶颈。因此,我们提出了一种能够有效处理路由表内IP路由查找、插入和删除的查找方案。通过引入内存缩减和新颖的跳过功能,我们成功地将所需的内存大小减少到约0.59 mb。进行了路由表VLSI设计。它可以实现一个路由查找为每个内存访问使用管道实现。Timemill布局后仿真结果表明,该芯片可以提供大约30/spl次/10/sup / 6/查找/s,因此当帧大小为1000比特时,它可以支持高达30 Gbits/s的链路速度。此外,我们的设计可以很容易地从IPv4扩展到IPv6。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Vector quantization fast search algorithm using hyperplane based k-dimensional multi-node search tree Constant quality rate control for streaming MPEG-4 FGS video Joint space-multipath-Doppler RAKE receiving in DS-CDMA systems over time-selective fading channels Why the terms 'current mode' and 'voltage mode' neither divide nor qualify circuits A robust DWT-based video watermarking algorithm
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1