Non-collision hash and table merger IPv6 route lookup algorithm

In this article, the authors survey the recent advances in the research of route lookup algorithm and introduce some of the typical algorithms. At last, a novel route lookup algorithm is proposed based the non-collision hash and table merger(NHTM) algorithm, which is based on Non-Collision Hash Trie-Tree Algorithm and Grid of Tries algorithm. The core of algorithm has four parts: (1) constructing hash function mainly based on RES and NLA so that the hash function can avoid space explosion problem; (2) incorporating two kinds of algorithm,. which are the Lakshman and Stiliadis propose a 2-dimensional classification algorithm and the algorithm of Grid of Tries as well as transforming Grid of Tries for the Trie-tree primed and jumping table in order to reduce space complexity; (3) incorporating jumping table item. After expanding normally, this doesn't increase the time complex degree of algorithm because we introduce the jumping table. Space complexity consumed and space requirement are less than those of algorithm. Test results show that the classification rate of NHTM algorithm is up to 5 million packets per second and the maximum memory consumed is 50MB for 10,000 rules.