An Efficient Range Matching Method for Zero Range Expansion Based on bf_tcam
A matching method and range technology, applied in the field of high-efficiency range matching based on BF_TCAM to achieve zero range expansion, can solve the problems of high power consumption and low storage utilization, and achieve the goal of reducing power consumption, improving update performance, and reducing circuit resource overhead. Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0035] Bloom filter algorithm introduction: Bloom Filter is a random data structure with high space efficiency. It uses bit arrays to succinctly represent a set, and can determine whether an element belongs to the set. The Bloom Filter contains an m-bit array, and each bit is set to 0 in the initial state. In order to express a set S={s1, s2,...,sn} containing n elements, Bloom Filter uses k mutually independent hash functions hash_i (i=1,2...,k) to separate each element in the set Maps into the range {1,...,m}. For any element x, the position hash_i(x) of the i-th hash function mapping will be set to 1 (1≤i≤k), such as figure 1 shown.
[0036] When judging whether s belongs to a set, apply the hash function k times to s, if all the positions of hash_i(s) are 1 (1≤i≤k), then s hits this set with a high probability, otherwise it can be determined s does not belong to this set. Such as figure 2 As shown, it can be determined that y1 is not an element in the set, and it is...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


