快速数据包分流算法研究

Research and fast algorithm for packet classification

基于"流"的数据包分类算法已经在第四层交换等领域中得到了应用,该类算法的特点是流表的容量大,流表的更新速度较快。"快速的数据包分流算法"采用了散列算法的基本思想,并引入了流的局部性原理来加速散列查找的过程,用软件对该算法进行了仿真测试,并在最后从时间复杂度和空间复杂度两个方面对其进行了性能分析。实验结果表明,该算法具有良好的时间复杂度和空间复杂度,可以实现快速的分流。

The process of categorizing packets into “flows” in an Internet router is called packet classification. All packets belonging to the same flow obey a pre-defined rule and are processed in a similar manner by the router, At present, the classified algorithm based on flow has been applied in the fourth-layer switch. The advantage ofthis kind of algorithm is that the content ofthe flow table is bigger and its updating speed is faster. An algorithm with fast classify packet into flow was given. At last, its performance of time complexity and space complexity was analyzed. The analysis shows that this algorithm has nice time complexity and space complexity and can achieve fast shunt.