摘要： 通过分类规则矩阵的分析,构造适于硬件实现的Patricia分类树,从而实现了基于Patricia树的快速多维分组分类算法PBT。该算法具有较好的灵活性和可扩展性,在存储空间、查找时间上也具有较强的优越性。

关键词: 范围关键词, 规则矩阵, 叶链, 末端匹配

Abstract: By the analysis of classification rules matrix, a Patricia tree is built, which is easy to be implemented by hardware, and a high speed algorithm of multi-dimensional packet classification based on Patricia tree is presented. The algorithm is flexible and scalable, and provides better time and space complexity.

中图分类号: 

• TP393