作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (04): 269-271. doi: 10.3969/j.issn.1000-3428.2012.04.088

• 开发研究与设计技术 • 上一篇    下一篇

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

李鲲鹏,兰巨龙   

  1. (国家数字交换系统工程技术研究中心,郑州 450002)
  • 收稿日期:2011-08-17 出版日期:2012-02-20 发布日期:2012-02-20
  • 作者简介:李鲲鹏(1985-),男,硕士研究生,主研方向:深度数据包检测;兰巨龙,教授、博士生导师
  • 基金资助:
    国家“863”计划基金资助项目“高可信网络管控系统”(2009AA01A346)

Efficient Unfixed Keywords Matching Algorithm Based on TCAM

LI Kun-peng, LAN Ju-long   

  1. (National Digital Switching System Engineering & Technological R&D Center, Zhengzhou 450002, China)
  • Received:2011-08-17 Online:2012-02-20 Published:2012-02-20

摘要: 针对传统浮动关键词匹配算法功耗高和速率低的问题,提出一种基于三态内容寻址寄存器(TCAM)的高效匹配算法。该算法应用关键词分类数据结构,将关键词存储在不同的TCAM模块中,并只将疑似关键词送入TCAM中查找匹配,从而减少每次访问TCAM查找的表项数目,提高一个查询周期内待匹配报文的移动速度。仿真结果表明,与传统算法相比,该算法功耗较低、匹配速度较快。

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

Abstract: 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.

Key words: unfixed keywords, Ternary Content Addressable Memory(TCAM), keywords classification data structure, allotter

中图分类号: