A Hybrid Scheme of Filter Implemented on FPGA for Faster IP Route Lookup

The Bloom filter is the most popular architecture to perform membership queries, but the cuckoo filter developed in recent years has also gained in popularity, which addresses the aspects of supporting deletion and space overhead. In this paper, we first compare the Bloom filter and cuckoo filter focusing on the false positive probability. Based on that observation, motivated by the application of the Bloom filter in IP route lookup, we propose a new filter architecture called a cuckoo Bloom hybrid filter (CBHF), aiming to realize faster IP route lookup with a limited requirement of storage. Our simulation and implementation results show that CBHF parallelly implemented on an FPGA can achieve high performance in terms of lookup accuracy and speed.