Packet Classification Using Two-Dimensional Multibit Tries

  • Authors:

  • Wencheng Lu

  • Affiliations:

  • University of Florida

  • Venue:
  • ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We develop fast algorithms to construct space-optimal constrained two-dimensional multibit tries for Internet packet classifier applications. Experimental evidence suggests that using the same memory budget, space-optimal two-dimensional multibit tries require 1/4 to 1/3 the memory accesses required by two-dimensional one-bit tries for table lookup.