Issue No.12 - December (2009 vol.58)
Wencheng Lu , University of Florida, Gainesville
Sartaj Sahni , University of Florida, Gainesville
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2009.127
We develop fast algorithms to construct space-optimal constrained 2D multibit tries for Internet packet classifier applications. Experimental evidence suggests that space-optimal 2D multibit tries and their extensions using a bucket scheme are superior to existing 2D and multidimensional packet classification schemes in terms of both memory requirement and number of memory accesses requirement. We propose a heuristic for 2D multibit tries with switch pointers, which may be used for 2D packet classification.
Packet classification, 2D tries, multibit tries, switch pointers, prefix expansion, fixed-stride tries, variable-stride tries, dynamic programming.
Wencheng Lu, Sartaj Sahni, "Efficient 2D Multibit Tries for Packet Classification", IEEE Transactions on Computers, vol.58, no. 12, pp. 1695-1709, December 2009, doi:10.1109/TC.2009.127