Multiple-field matching is one of the most commonly used mechanisms
for the Internet services, a major factor that affects client
perceived latency. Inspired by the recursive flow classification (RFC)
scheme, we set off to implement prototype classifier and construct a
test bed to evaluate the performance of this scheme as compared to the
brute force multiple-field matching. Our finding shows that the
latency of RFC is relatively constant regarding the number of rules,
while it increases quickly with the brute force approach. It also
shows although RFC has a comparatively larger memory requirement, but
can be reasonably handled by the size of the memory available on most
of the hosts today.