.png){kind=icon}
Return
Packet classification using space-efficient pipelined multibit tries
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2007.70846.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 what is required by optimal pipelined fixed-stride tries. In addition, 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 nonpipelined architectures.
Keywords:
packet classification
longest matching prefix
controlled prefix expansion
fixed-stride tries
variable-stride tries
two-dimensional tries
dynamic programming
Journal
IF:
3.8
Papers:
5.4K
Citations:
9.8K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
ShareSave
View more