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

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.