The core of algorithm consists of three parts: structure the non-collision hash function, which is constructed mainly based on destination/source port and protocol type field so that the hash function usually can avoid space explosion problem; intro- duce multibit Trie-tree based the key .

Study on Chinese-English dictionary lookup mechanism based on combining Trie-tree with inverted index;

A Jumping Table Trie-tree IP 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.

After analyzing the binary-Trie tree, an algorithm of IP address classification bases on 256-branch search tree is introduced.

We improved the structure of Trie tree,a kind of ordered tree,to build a pinyin tree,and then implement the intelligent Chinese pinyin input under uCLinux.

Binary Search on Levels (BSOL) algorithm, which supports range and prefix rules, is a time efficient packet classification algorithm and can extend to multi-dimension packet classification easily while its performance is affected badly when the load factor of hash table is large or hash collision occurs frequently since the key structure is a hash table created by Trie tree in every layer.

In order to improve the network performances of the wireless sensor network applied in the underground mine,to reduce the congestion at the sink nodes and to ensure the reliability of the underground wreless communication,the multiple-tree theory was applied to improve the S-MAC protocol.