Bloom filter is a data structures that provides a
probabilistic representation of a set and allows
membership testing in constant time.  Bloom filters
are implemented using hash functions.  Recently,
Bloom filters have been proposed for fast data
packet forwarding.  In this work you survey recent
fast forwarding solutions and propose optimizations
to the current systems.