Efficient Bloom filter for network protocols using AES instruction set

The Internet continues to flourish, while an increasing number of network applications are found deploying Bloom filters. However, the heterogeneity of the Bloom filter realisations complicates the utilisation of relevant applications. Moreover, when applying Bloom filter to traffic that usually has a gigabit capacity, even insignificant delays will accumulate and restrict the effectiveness of the real-time protocols. In this study, the authors present a Bloom filter construction that can be easily and consistently adopted at network nodes, with also considerable processing speed. Specifically, the authors show that AES-based hashes are adequate to create Bloom filters correctly. Then they illustrate how AES new instructions (AES-NI) can be leveraged to accelerate the Bloom filter realisation. According to the authors' experimental results, the proposed Bloom filter enables the best speed performance compared to the competing approaches.