【摘要】 在Internet路由器中将数据包分类成流采用了散列算法的基本思想,并引入了流的局部性原理来加速散列查找的过程,用软件对该算法进行了仿真测试,并在最后从时间复杂度和空间复杂度两个方面对其进行了性能分析。实验结果表明,该算法能够快速地实现分流。更多还原

【Abstract】 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. The main idea is Hash algorithm. How to speed the hash search with the localness of flow has been introduced. At last, its performance of time complexity and space complexity is analyzed. The analysis shows that this algorithm has nice time complexity and space complexity and can achieve fast shunt.更多还原