| IP报文分类算法研究 |
| |
| 引用本文： | 李学锋.IP报文分类算法研究[J].襄樊学院学报,2010,31(8):38-41. |
| |
| 作者姓名： | 李学锋 |
| |
| 作者单位： | 襄樊学院,数学与计算机科学学院,湖北,襄樊,441053 |
| |
| 摘 要： | 从报文分类算法的实现特征出发,对当前常用的报文分类算法进行分类评述,分析了它们的时间、空间和更新复杂度以及各分类算法的优势、存在的不足和适用环境;最后,就报文分类问题的研究方向作出展望.
|
| 关 键 词： | IP报文分类 时间复杂度 空间复杂度 更新复杂度 |
Research on IP Packet Classification Algorithm |
| |
| LI Xue-feng.Research on IP Packet Classification Algorithm[J].Journal of Xiangfan University,2010,31(8):38-41. |
| |
| Authors: | LI Xue-feng |
| |
| Institution: | LI Xue-feng(School of Mathematical and Computer Sciences,Xinagfan University,Xinagfan 441053,China) |
| |
| Abstract: | According to their implementation features,this paper divided IP packet classification algorithms usually used into different types and described them one by one in detail.It also gives the time complexity,space complexity,update complexity of the algorithms.It summarized the advantages,disadvantages as well as suitable application environments of different kinds of packet classification algorithms and prospected the future research issues on packet classification problem. |
| |
| Keywords: | IP packet classification Time complexity Space complexity Update complexity |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
