We develop algorithms for the compact representation of the 1- and 2-dimensional tries that are used for Internet packet classification. Our compact representations are experimentally compared with competing compact representations for 1- and multi-dimensional packet classifiers and found to simultaneously reduce the number of memory accesses required for a lookup as well as the memory required to store the classifier.
No takes yet. Share an insight, caveat, or question.
Lu et al. (2009) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: