基于TCAM的高效浮动关键词匹配算法  

Efficient Unfixed Keywords Matching Algorithm Based on TCAM

作　　者：李鲲鹏[1] 兰巨龙[1] 

机构地区：[1]国家数字交换系统工程技术研究中心,郑州450002

出　　处：《计算机工程》2012年第4期269-271,274,共4页Computer Engineering

基　　金：国家"863"计划基金资助项目"高可信网络管控系统"(2009AA01A346)

摘　　要：针对传统浮动关键词匹配算法功耗高和速率低的问题,提出一种基于三态内容寻址寄存器(TCAM)的高效匹配算法。该算法应用关键词分类数据结构,将关键词存储在不同的TCAM模块中,并只将疑似关键词送入TCAM中查找匹配,从而减少每次访问TCAM查找的表项数目,提高一个查询周期内待匹配报文的移动速度。仿真结果表明,与传统算法相比,该算法功耗较低、匹配速度较快。To deal with the high power consumption and low speed of unfixed keywords matching based on Ternary Content Addressable Memory（TCAM）, a low power consumption and high speed unfixed keywords matching algorithm is proposed. With the help of keyword classification data structure, keywords are stored in different blocks of TCAM and only the suspected keywords are put into TCAM to match. Therefore, the algorithm decreases the entries of TCAM and increases the average step length of data packets for each query cycle, so it can effectively reduce the power consumption of TCAM and improve the matching speed. Simulation result shows that the algorithm has lower power consumption and faster matching speed than traditional algorithms.

关 键 词：浮动关键词 三态内容寻址寄存器 关键词分类数据结构 分配器 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]