When more people use the network, the overall network traffic grows steadily. To achieve better performance, devices connecting different end systems must process incoming packets at wire speed. One critical aspect of packet processing is IP lookup. So, an effective mechanism for parallelizing IP lookup on General-Purpose Graphics Processing Unit (GPGPU) is introduced in this work. Considering that, the complexity of the lookup operation increases with IP address length, the proposed approach reduces the length of each IP address by employing suitable compression techniques. Consequently, IP address lookup is conducted in parallel using longest prefix match (LPM) by splitting compressed IP address into two parts. In this proposed work, the lookup complexity can be reduced to O (w/ (2 k) ) than binary trie, where w, k represents IP prefix length and stride value respectively. The experimental results highlight that GPU-based IP lookup shows 84% improvement than CPU-based approaches and 89% and 97% improvement than GPU based hashing and GPU based Binary Search Tree (BST) respectively.
Sonai et al. (Wed,) studied this question.