A serial and non-collision hash algorithm

In order to deal with the classification of IP packets, a novel IP classification is proposed based the serial and non-collision hash (SNH) algorithm, which is based on non-collision hash trie-tree algorithm and grid of tries algorithm. The core of the algorithm has three parts: (1) the structure of the hash function, which is constructed mainly based on destination port and protocol-type field so that the hash function can avoid a space explosion problem; (2) we transform grid of tries for the trie-tree pruned and jumping table in order to reduce space complexity toward the source IP prefix; (3) we use the trie-tree pruned toward the destination IP prefix so that stock space does not exceed total rule number, and at the same time, we introduce a serial algorithm in the source port lookup. After expanding normally, it does not increase the time complexity of the algorithm, because we introduce the jumping table. The SNH algorithm used for packet classification includes two phases. The first is a preprocessing phase, in which the hash table and pruned trie-tree are created based on a matching rule set. The second is a matching phase in which packet classification is executed. The test results show that the classification rate of the SNH algorithm is up to 0.4 million packets per second and the maximum memory consumed is 8 MB for 10,000 rules.