A Trie based IP Lookup Approach for High Performance Router/Switch

Packet forwarding on the Internet takes place using the IP address of the incoming packet. Since current Internet uses CIDR based addressing scheme, finding the best match for a given destination IP is challenging. These addressing scheme uses a method called Longest Prefix Matching (LPM) to find the best match from multiple matches. There are several software based algorithm is proposed to find the LPM for given destination IP address. The number of comparisons for a given destination IP address depends on the length of the IP prefix. If the length of the IP prefix increases, the number of comparisons also increases. In the worst case, for IPv4 normally it takes 32 comparisons to find the next hop. In order to reduce the number of comparisons, this paper uses efficient compression over the IP prefixes and perform IP lookup operations over the forwarding table.

[1]  Sartaj Sahni,et al.  IP Lookup by Binary Search on Prefix Length , 2002, J. Interconnect. Networks.

[2]  Viktor K. Prasanna,et al.  Scalable GPU-Accelerated IPv6 Lookup Using Hierarchical Perfect Hashing , 2014, GLOBECOM 2014.

[3]  Walid Dabbous,et al.  Survey and taxonomy of IP address lookup algorithms , 2001, IEEE Netw..

[4]  Jatin Goyal,et al.  Parallel binary search trees for rapid IP lookup using graphic processors , 2013, 2013 2nd International Conference on Information Management in the Knowledge Economy.

[5]  Gang Wang,et al.  A Dynamic IP Lookup Architecture using Parallel Multiple Hash in GPU-based Software Router , 2013 .

[6]  Surajeet Ghosh,et al.  A hash based architecture of longest prefix matching for fast IP processing , 2016, 2016 IEEE Region 10 Conference (TENCON).

[7]  Haoyu Song,et al.  Shape shifting tries for faster IP route lookup , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[8]  Sartaj Sahni,et al.  Efficient construction of multibit tries for IP lookup , 2003, TNET.

[9]  Masoud Sabaei,et al.  Evaluation and Comparison of Binary Trie base IP Lookup Algorithms with Real Edge Router IP Prefix Dataset , 2016 .

[10]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[11]  Yakov Rekhter,et al.  An Architecture for IP Address Allocation with CIDR , 1993, RFC.

[12]  Hyesook Lim,et al.  New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based Algorithms , 2016, IEEE Transactions on Computers.

[13]  Satendra Kumar Maurya.  Design and implementation of longest prefix matching content addressable memory for IP routing , 2009 .

[14]  Viktor K. Prasanna,et al.  Scalable GPU-Accelerated IPv6 Lookup Using Hierarchical Perfect Hashing , 2014, 2015 IEEE Global Communications Conference (GLOBECOM).