O(logW) multidimensional packet classification
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
This paper describes a new algorithm for packet classificationusing the concept of independent sets. The algorithmhas very small memory requirements. The searchspeed is neither sensitive to the size of the rule table nor tothe percentage of wildcards in the fields. It also scales wellfrom two dimensional classifiers to high dimensional ones.In particular, the algorithm is inherently parallel. Hardwaretailored to this algorithm can achieve very fast searchspeed.