基于变步长Trie树的数据包分类技术的研究与实现-计算机科学与技术专业论文.docxVIP

哈尔滨工业大学工学硕士学位论文 哈尔滨工业大学工学硕士学位论文 哈尔滨工业大学工学硕士学位论文 哈尔滨工业大学工学硕士学位论文 - - PAGE IV - - -III- Abstract Packet classification is a kind of basic technique in management of network ，which plays an important role especially in the field of network access control and network services-oriented Qos control. The previous research of packet classification algorithms focus on static algorithm, mainly about speeding up the match of process. But now the network security systems which face on united threat management are consist of multiple interacting parts. Access Control List’dispensing and updating has been automated. So the quantity and frequency of dynamic updating regularly improves a lot, meanwhile the speed of updating influences even determines the performance of the network security system. This paper begins with analyzing the ACL and researching the characters of the rules library, according to the characters of the distribution, introduces a packet classification algorithm basing on the varied step trie. It uses the varied step trie structure, according to the source address of the rule set, picks the property gradient varied step width, found a trie. Because of this architecture, searching operation is reduced greatly in process. And also considering the linear table, hash table and bintree structure, we can quickly found a compound search tree stucture basing on varied step trie. All of this not only keeps the high speed of data packet classification, but also speed up ACL’s delete and add operation, in order to dynamically updating the rule library. At last the paper will introduce the packet classification system basing on the special purpose Linux system platform of the varied step trie in detail. This system can run steadily, also get the nice applying performance. The packet classification algorithm introduced in this paper which is better than the other algorithms on performance, especially in the field of average access memory times and pre-proccess time.Unde