An effective IP routing lookup algorithm based on network processor

The speed of interconnection has grown continually in the fast developing Internet and other networks. Routing lookup has become the bottleneck of high-speed packet forwarding. Obviously, high-speed packet forwarding depends on high-speed routing lookup and update algorithms. This paper discusses Longest Prefix Match algorithm (LPM) based on the hardware structure of network processor (NP). The LPM algorithm takes multibit trie to organize routing table. Some test shows that it can implement high throughput based on NP. Then, an improved LPM lookup algorithm is presented here to speed up routing lookup. In the improved algorithm the lookup simultaneously uses 8-4-3 and 16-4-4-4-4 bits from the IP addresses and employs NP¿s resources sufficiently. This dual lookup scheme is more effective in the performance of routing update.

[1]  Zhen Liu,et al.  A low-latency software-based route lookup implementation for network processors , 2004, Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955).

[2]  Bo-Heung Chung,et al.  Incorporating intrusion detection functionality into IXP2800 network processor based router , 2006, 2006 8th International Conference Advanced Communication Technology.

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

[4]  Saewoong Bahk,et al.  Flexible and fast IP lookup algorithm , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

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

[6]  Yan Ma,et al.  Trie-based Observations on the Routing Tables , 2006, 2006 Japan-China Joint Workshop on Frontier of Computer Science and Technology.

[7]  Lars-Åke Larzon,et al.  High-performance longest prefix matching supporting high-speed incremental updates and guaranteed compression , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..