An efficient hybrid hierarchical trie packet classification algorithm based on No Prefix relationship

Packet classification has become an important part of the modern network technology and communication technology. However, the complexity of the process of packet classification determines that there are many technical problems in the implementation and update of the packet classification algorithm. In this paper, we propose an efficient packet classification hierarchical structure, called the No Prefix relationship Hierarchical Trie algorithm. The structure is on the base of the hierarchical trie structure, and by judging the prefix relationship before building the structure we can able to eliminate the hierarchical trie structure's backtracking operation. Moreover, as we follow the node path compression strategy, the structure can greatly improve the storage performance. The experimental results show that compared with traditional trie algorithm, the algorithm proposed is superior to 47.74%-62.39% at the aspect of the search time and memory savings of 29.51%-30.35%. © 2013 Binary Information Press.