Hash函数实现数据包分流算法研究

Research on Hash Algorithm of Packet Classify Into Flow

随着 Internet 规模的不断扩大与应用技术的不断进步,越来越多的业务需要对数据包进行实时、快速的分类,对数据包分类的研究具有重要的现实意义。Hash 算法采用了散列算法的基本思想,并引入了流的局部性原理加速散列查找的过程。由于时间精确度较高和面向对象的特点,选用了 C^(++)语言编程对该算法进行了仿真测试,最后对 Hash 算法分析表明,Hash 算法具有良好的时间复杂度和空间复杂度,可以实现快速的分流。

With the development of Internet technology and improvement of application technology, real-time and fast packet classifications have been applied to more and more services. In this article,an algorithm with fast classify packet into flow was give. It takes Hash algorithm as main idea,and speeding hash search with the localness of flow. Accord ing to the characters of high time precision and object-oriented,C＋＋ to emulate this algorithm was chosen. At last,time complexity and space complexity were analyzed. The analysis shows that this algorithm has nice time complexity and space complexity and can achieve fast shunt.