The Research on Accelerated Routing Lookup Algorithms

With the rapid development of the network, the speed of optical fiber and interface transmission has been improved, and the ability of network equipment to handle message processing has become the main bottleneck of the current high performance network development. Core routing turned sharply increasing scale of published, leading to increasing demand time and memory look-up table, and the need to press the longest prefix match when forwarding lookup, make address lookup in numerical and length on the two dimensions. Therefore, to deal with a large number of packets and ensure network quality, faster routing search speed is needed. Surrounding the technology of high performance routing lookup is studied, this paper puts forward two kinds of routing lookup algorithm based on GPU acceleration technology, based on hash table(CUCKOO FILTER) lookup algorithm of acceleration and LCTrie acceleration of tree search algorithm, and compared and analyzed the advantages and disadvantages of the two methods.