Improving Bloom Filter Forwarding Architectures

To improve Bloom filter-based packet forwarding architectures, we introduce one additional Bloom filter that stores the correct next hop information for recent false positives so as to handle subsequent false positives. Through Click-based experiments, we show that the additional Bloom filter reduces the average table lookup time (i.e., from 120 ns to 93 ns) by handling most false positives within the fast memory.