首页 | 本学科首页   官方微博 | 高级检索  
     

基于TCAM的高效浮动关键词匹配算法
引用本文:李鲲鹏,兰巨龙. 基于TCAM的高效浮动关键词匹配算法[J]. 计算机工程, 2012, 38(4): 269-271
作者姓名:李鲲鹏  兰巨龙
作者单位:国家数字交换系统工程技术研究中心,郑州,450002
基金项目:国家“863”计划基金资助项目“高可信网络管控系统”(2009AA01A346)
摘    要:针对传统浮动关键词匹配算法功耗高和速率低的问题,提出一种基于三态内容寻址寄存器(TCAM)的高效匹配算法。该算法应用关键词分类数据结构,将关键词存储在不同的TCAM模块中,并只将疑似关键词送入TCAM中查找匹配,从而减少每次访问TCAM查找的表项数目,提高一个查询周期内待匹配报文的移动速度。仿真结果表明,与传统算法相比,该算法功耗较低、匹配速度较快。

关 键 词:浮动关键词  三态内容寻址寄存器  关键词分类数据结构  分配器
收稿时间:2011-08-17

Efficient Unfixed Keywords Matching Algorithm Based on TCAM
LI Kun-peng , LAN Ju-long. Efficient Unfixed Keywords Matching Algorithm Based on TCAM[J]. Computer Engineering, 2012, 38(4): 269-271
Authors:LI Kun-peng    LAN Ju-long
Affiliation:(National Digital Switching System Engineering & Technological R&D Center, Zhengzhou 450002, China)
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.
Keywords:unfixed keywords  Ternary Content Addressable Memory(TCAM)  keywords classification data structure  allotter
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号