Efficient 2D Multibit Tries for Packet Classification

doi:10.1109/TC.2009.127

Efficient 2D Multibit Tries for Packet Classification

2009-12-01

4

PRE

AI

DOI：10.1109/TC.2009.127

原文链接

原文求助

摘要

En 中文

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.

Keyword:

Packet classification

2D tries

multibit tries

switch pointers

prefix expansion

fixed-stride tries

variable-stride tries

dynamic programming

Efficient 2D Multibit Tries for Packet Classification

摘要

AI总结

期刊

机构