返回
O(log W) multidimensional packet classification
DOI:10.1109/TNET.2007.892845.png)
摘要
En 中文
We use a collection of hash tables to represent a multidimensional packet classification table. These hash tables are derived from a trie-representation of the multidimensional classifier. The height of this trie is O(W), where W is the sum of the maximum possible length, in bits, of each of the fields of a filter. The leaves at level iota of the trie together with markers for some of the leaves at levels j such that j > i are stored in a hash table H-iota. The placement of markers is such that a binary search of the H-iota's successfully locates the highest-priority filter that matches any given packet. The number of hash tables equals the trie height, O(W). Hence, a packet may be classified by performing O(log W) hash-table lookups. So the expected lookup-complexity of our data structure for multidimensional packet classification is O(log W). Our proposed scheme affords a memory advantage over the O(log W) 1-D scheme of Waldvogel et al For multidimensional packet classification, our proposed scheme provides both a time and memory advantage over the extended grid-of-tries scheme of Baboescu et al.
Keyword:
binary search on levels
expected complexity
multidimensional packet classification
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
暂无机构信息
引用论文
Effects of 6-Week Supplementation with GliSODin on Parameters of Muscle Damages, Metabolic, and Work Performance at International Level Rowers after Specific Maximal Effort6周GliSODin补充剂对国际水平赛艇运动员在特定最大努力后肌肉损伤参数、代谢及运动表现的影响
Biology
IF0

