资料下载
×
TCAM表项管理算法研究
消耗积分:5 |
格式:rar |
大小:134 |
2009-06-01
33391
分享资料个
为了克服传统的软件路由查找机制的瓶颈, 高速路由器目前的查表方案是基于TCAM 的硬件路由查找。由于路由查找的最长前缀匹配要求,TCAM 要解决路由表项的高效存储和管理问题。本文讨论了目前的基于TCAM 的表项管理算法,对当前研究的新进展进行了重点分析和比较,为进一步的研究提出了新的思路。在863 重大课题“可扩展到T 比特的高性能IPv4/v6 路由器基础平台及实验系统”中,得到很好的应用。
关键词：最长前缀匹配，表项更新，前缀覆盖
Algorithm Research of Managing TCAM Routing Entries Zhao Zhengrong , Li Peng , Lan Julong ( NDSC,Information Engineering University,Zhengzhou 450002,Henan ) [Abstract] Faced the bottleneck of traditional software mechanism of routing lookups,high_speed routers take the measure of hardware methods based on TCAM presently.But the request of longest_prefix matching brings out the question of efficient storage and updating.In this paper,we discuss the present updating algorithms based on TCAM,and emphasize the analysis and comparison of the emerging progress of the current research for the new direction.
[Keywords] longest_prefix match ,entries updating , prefixs_overlap
关键词：最长前缀匹配，表项更新，前缀覆盖
Algorithm Research of Managing TCAM Routing Entries Zhao Zhengrong , Li Peng , Lan Julong ( NDSC,Information Engineering University,Zhengzhou 450002,Henan ) [Abstract] Faced the bottleneck of traditional software mechanism of routing lookups,high_speed routers take the measure of hardware methods based on TCAM presently.But the request of longest_prefix matching brings out the question of efficient storage and updating.In this paper,we discuss the present updating algorithms based on TCAM,and emphasize the analysis and comparison of the emerging progress of the current research for the new direction.
[Keywords] longest_prefix match ,entries updating , prefixs_overlap
声明：本文内容及配图由入驻作者撰写或者入驻合作网站授权转载。文章观点仅代表作者本人，不代表电子发烧友网立场。文章及其配图仅供工程师学习之用，如有内容侵权或者其他违规问题，请联系本站处理。 举报投诉
评论(0)
发评论
- 相关下载
- 相关文章
