The Community for Technology Leaders
Green Image
We propose heuristics for the construction of variable-stride one-dimensional as well as fixed- and variable-stride two-dimensional multibit tries. These multibit tries are suitable for the classification of Internet packets using a pipelined architecture. The variable-stride one-dimensional tries constructed by our heuristic require significantly less per-stage memory than required by optimal pipelined fixed-stride tries. Also, the pipelined two-dimensional multibit tries constructed by our proposed heuristics are superior, for pipelined architectures, to two-dimensional multibit tries constructed by the best algorithms proposed for non-pipelined architectures.
Packet classification, longest matching prefix, controlled prefix expansion, fixed-stride tries, variable-stride tries, two-dimensional tries, dynamic programming.

W. Lu and S. Sahni, "Packet Classification Using Space-Efficient Pipelined Multibit Tries," in IEEE Transactions on Computers, vol. 57, no. , pp. 591-605, 2007.
82 ms
(Ver 3.3 (11022016))