Enhancing Dynamic Packet Filtering Technique with d-Left Counting Bloom Filter Algorithm

In the previous study of dynamic packet filtering technique, Counting Bloom Filter (CBF) algorithm was adopted to implement the filtering rule´s adding and deleting dynamically. However, the drawbacks of CBF, i.e., low memory utilization, limited rule capacity and high false positive rate, are obvious. In this paper, d-left Counting Bloom Filter (d-left CBF) algorithm is exploited to improve the performance of the dynamic packet filtering. Through the usage of the algorithm, compared with CBF, approximately 56 times memory space is saved. In addition, with the increasing of memory allocation, the false positive rate of d-left CBF decreases more significantly than CBF. The experimental results and corresponding analyses indicate that d-left CBF is feasible and high-efficient in the process of the dynamic packet filtering.