.png){kind=icon}
返回
Packet classification using space-efficient pipelined multibit tries
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2007.70846.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
packet classification
longest matching prefix
controlled prefix expansion
fixed-stride tries
variable-stride tries
two-dimensional tries
dynamic programming
期刊
IF:
3.8
论文数:
5.3K
被引数:
9.8K
机构
引用论文
.png){kind=icon}
Health and mineral nutrition status of yaks in southern Mustang, Nepal尼泊尔 Mustang 南部地区牦牛的健康与矿物质营养状况
PREAI
分享收藏分享收藏
查看更多内容