一种基于Bloom-filter表项压缩的TCAM业务识别算法  

A TCAM Service Identification Algorithm Based on Access Compression Using Bloom-filter

作　　者：陈正虎 兰巨龙[1] 黄万伟[1] 李玉峰[1] 

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

出　　处：《电子与信息学报》2011年第9期2212-2218,共7页Journal of Electronics & Information Technology

基　　金：国家863计划重大专项;高可信业务管控系统基金(2009AA01A346)资助课题

摘　　要：在三态内容寻址存储器(Ternary Content Addressable Memory,TCAM)表项宽度和存储容量约束下,该文提出一种基于匹配表项压缩的BF-TCAM算法,采用Bloom-Filter(BF)对匹配关键字进行单字节编码压缩关键字长度,解决了匹配吞吐率低和存储空间不足问题。针对BF在表项压缩过程带来的冲突率上升问题,引入向量存储空间策略,利用向量存储空间实现多个哈希函数映射,相对于比特向量策略,有利于降低匹配冲突率。测试实验表明,相对于传统的TCAM匹配算法,BF-TCAM算法不但提高了匹配吞吐率和存储空间利用率,同时可有效降低BF压缩产生的冲突率。Within the confines of access width and storage capacity in Ternary Content Addressable Memory（TCAM） chip,pattern matching algorithm using TCAM has low throughput and limited memory.This paper proposes BF-TCAM algorithm based on access compression by single byte coding using Bloom-Filter（BF） algorithm,increases the throughput and improves the utilization efficiency of storage space.BF algorithm will bring collision,which can be reduced by using vector memory instead of bit vector in BF-TCAM algorithm.The experimentation shows that the BF-TCAM algorithm proposed in this paper can improve the matching throughput and storage space utilization,and at the same time,effectively reduce the conflict ratio resulting from BF compression.

关 键 词：三态内容寻址存储器(TCAM) Bloom滤波器(BF) 模式匹配 

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