A Cache Architecture for Counting Bloom Filters: Theory and Application

<table>The <svg height="12.4375" id="M46" style="vertical-align:-0.1638pt" version="1.1" viewbox="0 0 4.6999998 12.4375" width="4.6999998" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.162)"><path d="M238 681l-124 -585q-7 -31 4 -31q10 0 37.5 18.5t49.5 41.5l16 -22q-40 -48 -89.5 -81.5t-76.5 -33.5q-42 0 -16 122l105 488q7 32 0 41t-39 9h-35l5 26q35 3 71 13t58 17.5t26 7.5q14 0 8 -31z" id="x1D459"></path></g>
</svg>-level cached counting Bloom filter architecture.</table>

Journal of Electrical and Computer Engineering

fig4

Figure 4

Figure 4: A Cache Architecture for Counting Bloom Filters: Theory and Application 