implementation of the forwarding table based on Bloom filters. More...
#include <btable.h>
Public Member Functions | |
virtual void | consolidate () throw () |
Prepares the forwarding table for matching. |
implementation of the forwarding table based on Bloom filters.
This implementation extends the BTable algorithm simply by sorting the Bloom filters within each predicate. Bloom filters are sorted by their Hamming weight in ascending order. The rationale for this is that the basic BTable algorithm shortcuts the evaluation (only) when a match is found. Therefore, it is advantageous to try "smaller" Bloom filters first, because those are more likely to yield a match.
virtual void siena::SortedBTable::consolidate | ( | ) | throw () [virtual] |
Prepares the forwarding table for matching.
This function processes the forwarding table, packing some of its internal data structures and preparing them to be used to match events. This function must therefore be called after all the necessary calls to ifconfig and before matching messages with match().
The forwarding table can be reset by calling clear or clear_recycle.
Reimplemented from siena::ForwardingTable.