IP packet fast classification algorithm

In order to improve lookup efficiency, a novel IP classification, NHMT (non-collision Hash and nultibit-trie tree) is proposed, which is based on non-collision Hash trie-tree algorithm and grid of tries algorithm. The core of this algorithm has three parts: constructing Hash function mainly based on destination port and protocol type field so that the hash function can avoid space explosion problem; transforming Grid of tries for the trie-tree pruned and multibit-trie tree in order to reduce space complexity; adding a floor based on non-collision hash algorithm as source port number (or scope). After expanding normally, this doesn't increase the time complex degree of algorithm because the multibit trie tree is introduced. Space complexity consumed and space requirement are less than those of non-collision hash algorithm. Test results show that the classification rate of NHMT algorithm is up to 1 Mbit/s and the maximum memory consumed is 8.2 MB for 10000 rules.