共查询到19条相似文献,搜索用时 609 毫秒
1.
针对传统TCAM查找更新方法复杂度高、无法满足高性能路由器线速查找转发需求的问题,提出一种基于分组TCAM的路由查找更新技术.介绍T比特高性能路由器的系统架构,提出基于分组TCAM的路由查找更新架构,以及基于统计预测的预留表项空间算法,进行路由查找更新算法的设计.搭建测试验证环境,采用MAE-WEST和MAE-EAST路由表项数据,进行线速查找转发处理性能的分析测试. 相似文献
2.
3.
4.
5.
基于TCAM技术的高速路由查找方案 总被引:2,自引:0,他引:2
基于TCAM技术提出一个高速路由查找方案。该方案可以达到每秒钟100M次的查找速度,满足OC48和OC192接口的线速转发要求。方案使用了索引表和映射表的二级结构存储路由的下一跳信息,大大减小了存储空间,同时对IPv6具有很好的扩展性。对TCAM的路由更新问题进行了讨论,提出一个最坏情况下O(W/2)的更新算法(形为前缀长度集合的数目),有效地提高了TCAM的更新性能。 相似文献
6.
7.
8.
IPv4/IPv6双栈核心路由器需要一体化高效路由查找.但常用的单步TCAM路由查找方案要求转发表的存储必须按前缀长度相对地址降序排列,这种与地址关联的排序操作影响表项的更新速度和路由查找流程的连续性.提出并实现了一种独特的对前缀范围对分搜索的IPv4/IPv6双栈一体化多步TCAM流水查找方法.突出特点是转发表不需排序、查找速率高、表项更新快、查表连续性好.可满足IPv4/IPv6双协议栈核心路由器OC-768(40Gbps)端口、48B包的线速转发. 相似文献
9.
在软件定义网络(software-defined networking, SDN)中,OpenFlow交换机通常采用三态内容可寻址存储器(ternary content addressable memory, TCAM)存储流表,以支持快速通配查找.然而,TCAM采用并行查找方式,查找能耗高,因此有必要为OpenFlow交换机选择合适的TCAM容量,以平衡分组转发时延和能耗.针对软件定义数据中心网络(software-defined data center network, SD-DCN)这一典型应用场景,利用多优先级M/G/1排队模型刻画OpenFlow交换机的分组处理过程,进而建立OpenFlow分组转发时延模型.同时,基于网络流分布特性,建立TCAM流表命中率模型,以求解OpenFlow分组转发时延与TCAM容量的关系式.在此基础上,结合TCAM查找能耗,建立OpenFlow分组转发能效联合优化模型,并设计优化算法求解TCAM最优容量.实验结果表明:所提时延模型比现有模型更能准确刻画OpenFlow分组转发时延.同时,利用优化算法求解不同参数配置下的TCAM最优容量,为SD-DC... 相似文献
10.
《计算机应用与软件》2016,(7)
基于三态内容寻址存储器TCAM(Ternary Content-Addressable Memory)的路由查找方案是目前高性能路由器进行路由查找时普遍使用的方案,但这种方案仍存在查找速度、功耗和更新效率方面的挑战。因此,学者们提出了各种并行TCAM的解决方案以提高查找速度、降低功耗和增强更新效率。归类总结目前的并行TCAM路由查找方案,剖析它们的优缺点,指出目前这些方案仍存在的不足,并探索相应的解决方案。 相似文献
11.
12.
One popular hardware device for performing fast routing lookups and packet classification is a ternary content-addressable memory (TCAM). This paper proposes two algorithms to manage the TCAM such that incremental update times remain small in the worst case 相似文献
13.
Routing table lookup is an important operation in packet forwarding. This operation has a significant influence on the overall performance of the network processors. Routing tables are usually stored in main memory which has a large access time. Consequently, small fast cache memories are used to improve access time. In this paper, we propose a novel routing table compaction scheme to reduce the number of entries in the routing table. The proposed scheme has three versions. This scheme takes advantage of ternary content addressable memory (TCAM) features. Two or more routing entries are compacted into one using don’t care elements in TCAM. A small compacted routing table helps to increase cache hit rate; this in turn provides fast address lookups. We have evaluated this compaction scheme through extensive simulations involving IPv4 and IPv6 routing tables and routing traces. The original routing tables have been compacted over 60% of their original sizes. The average cache hit rate has improved by up to 15% over the original tables. We have also analyzed port errors caused by caching, and developed a new sampling technique to alleviate this problem. The simulations show that sampling is an effective scheme in port error-control without degrading cache performance. 相似文献
14.
15.
16.
17.
18.
Weidong Wu Jian Shi Ling Zuo Bingxin Shi 《Micro, IEEE》2005,25(4):64-72
Ternary content addressable memories (TCAM) have become a popular hardware device for fast routing-table lookups. However, the high power consumption in TCAM increases power supply and cooling costs, and limits the router design to fewer ports. Based on an analysis of the prefix hierarchy in routing tables, the authors propose an optimization model to reduce the power consumption for bursty access patterns. This model can reduce the average power consumption by a factor of 11. 相似文献
19.
提出一种兼容IPv4和IPv6报文高速路由查找方案,方案基于TCAM技术,同时对TCAM路由表更新算法进行比较,最后采用松散前缀顺序约束算法实现TCAM路由表的更新,并在网络处理器原型设计中得到应用。方案可以满足10Gbps速率IP报文线速转发的要求。 相似文献