摘要
分析了互联网路由表和路由更新的特征,提出了一种基于叶子节点进行路由表分区的并行IP路由查找方法Leaf-TCAM,分区子表按照流量特征在K个TCAM芯片中进行均衡分布。分析表明,该路由查找方法在引入0.1*(K-1)冗余的前提下具有K-1倍加速因子。该方法无需进行前缀扩展,90%以上的路由前缀无需排序,可以采用随机更新;同时还具有分区均匀、分区溢出代价小等特点,而功耗只有传统单片方案的12%。
Features of global routing table and prefix updates were analysized. A parallel IP address lookup scheme based on leaf nodes called Leaf-TCAM was proposed. The global routing table is partitioned into sub-tables and put into K^-independent TCAM chips. Our scheme can get speedup factor K-1 with 0. 1 ＊ （K-1） redundant. Prefix expansion is not needed and over 90% prefix updates can be done in random mode. Our scheme can partition the routing table evenly and has low cost when the sub-table is overflow. The power cunsumption is only 12% of traditional single chip scheme.
出处
《计算机科学》
CSCD
北大核心
2010年第4期63-66,共4页
Computer Science
基金
中国下一代互联网示范工程项目(CNGI-04-3-1D)
新一代光纤通信技术和网络国家重点实验资助
