Currently all matching is done with a linear search of the table. When all field matches are "exact", the process can be much more efficient by applying a hash to the values for the matches (and storing them in a hash table) and then applying the same hash to the packet's fields at the point of a lookup.
Should add support for this to the IRI implementation.
Currently all matching is done with a linear search of the table. When all field matches are "exact", the process can be much more efficient by applying a hash to the values for the matches (and storing them in a hash table) and then applying the same hash to the packet's fields at the point of a lookup.
Should add support for this to the IRI implementation.