Hierarchical Intelligent Cuttings with Bit Selection
碩士 === 國立臺灣科技大學 === 資訊工程研究所 === 89 === Search time and memory requirement are the two major performance factors of multi-field packet classification. To classify packet fast and to use reasonable storage are our design issues. In this paper, we use bit selection algorithm to improve Hiera...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/03877644665401046761 |
| Summary: | 碩士 === 國立臺灣科技大學 === 資訊工程研究所 === 89 === Search time and memory requirement are the two major performance factors of multi-field packet classification. To classify packet fast and to use reasonable storage are our design issues. In this paper, we use bit selection algorithm to improve Hierarchical Intelligent Cuttings (HiCuts). To apply bit selection algorithm, we can reorder the bit sequence of all bits in all fields. We can choose bits in any position and lead to the most uniform distribution of rules across nodes. In the worst case, the number of memory accesses of our proposed scheme for a table lookup is 12.
|
|---|