Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (5): 132-134.DOI: 10.3778/j.issn.1002-8331.2009.05.038
• 网络、通信、安全 • Previous Articles Next Articles
YANG Qian-bin,ZHANG Peng,CHEN Su-keng,ZHANG Xing-ming
Received:
Revised:
Online:
Published:
Contact:
杨乾斌,张 鹏,陈苏铿,张兴明
通讯作者:
Abstract: In order to deal with the multi-table look-up request caused by IPv4 unicast in large-scale access converging router,combining with the analysis of TCAM+SRAM look-up characteristics,this article brings forward a look-up solution based on double priority,and designs an entry reserved improved select moving algorithm about longest match entry fast update demand.Test shows that this approach can effectively settle the multi-table look-up problem of IPv4 unicast,increase the speed of entry update,economize the FPGA resource and improve the forwarding engine efficiency.
Key words: Ternary Content Addressable Memory(TCAM), look-up table, double priority, entry update, Virtual Private Network(VPN), VPN Routing Forwarding(VRF)
摘要: 针对大规模接入汇聚路由器IPv4单播报文的多表查找问题,结合对TCAM+SRAM查表技术特点的分析,提出了一种基于双优先级的IPv4单播查表解决方法,并对其中的最长匹配表项快速更新需求设计了一种预留表项空间的改进型选择移动算法。测试结果表明该方法能有效地解决IPv4单播报文的多表查找难题,提高表项的更新速度,节省FPGA资源,提高转发引擎的效率。
关键词: 三态内容可寻址存储器, 查找表, 双优先级, 表项更新, 虚拟专用网, VPN路由转发
YANG Qian-bin,ZHANG Peng,CHEN Su-keng,ZHANG Xing-ming. Look-up solution of IPv4 unicast based on double priority[J]. Computer Engineering and Applications, 2009, 45(5): 132-134.
杨乾斌,张 鹏,陈苏铿,张兴明. 基于双优先级的IPv4单播查表解决方法[J]. 计算机工程与应用, 2009, 45(5): 132-134.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2009.05.038
http://cea.ceaj.org/EN/Y2009/V45/I5/132
Mapping between de Bruijn sequences and algorithms for generating de Bruijn sequences by raising stage