implementation of the forwarding table based on Bloom filters and counting algorithm. More...
#include <bctable.h>
Static Public Member Functions | |
static BTable * | create () |
create and initialize a counting BTable. | |
![]() | |
static BTable * | create () |
create and initialize a BTable. | |
Additional Inherited Members | |
![]() | |
virtual void | ifconfig (InterfaceId, const Predicate &)=0 |
Associates a predicate to an interface. More... | |
virtual void | match (const Message &, MatchHandler &) const =0 |
Processes a message, calling the output() function on the given MatchHandler object for each matching interface. More... | |
implementation of the forwarding table based on Bloom filters and counting algorithm.
Like BTable, this implementation is based on encoded filters and messages. However, instead of using a linear scan of the set of encoded filters, this implementation uses a "counting" algorithm for matching that is conceptually vary similar to that implemented in FwdTable.
WARNING: This implementation is provided primarily for experimental purposes. See BTable for details.