A longest prefix first search tree for IP lookup

One of the key design issues for IP routers is the IP lookup mechanism. IP lookup is an important action in router that is to find the next hop of each incoming packet with a longest-prefix-match address in the routing table. In this paper, we put the routing table on a longest prefix first search tree. The tree is constructed as a heap by the prefix length. That makes a router executing IP lookup have the minimal number of memory accesses as compared with Trie [Sklower, K 1991], Patricia [Nilsson, S 1999] and Prefix tree [Berger, M 2003]. Some nodes of our tree can contain two entries of the routing table to reduce the number of tree nodes. For example, a 138286 of a routing table can be stored in 132050 nodes of our tree. Furthermore, the proposed scheme makes the tree can be updated without being reconstructed from scratch when the routing table is changed, and it can be applied in both the IPv4 and IPv6 routers.

[1]  Geoff Huston,et al.  Analyzing the Internet's BGP Routing Table , 2001 .

[2]  Svante Carlsson,et al.  Small forwarding tables for fast routing lookups , 1997, SIGCOMM '97.

[3]  M. Berger.  IP lookup with low memory requirement and fast update , 2003, Workshop on High Performance Switching and Routing, 2003, HPSR..

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

[5]  Lih-Chyau Wuu,et al.  A fast IP lookup scheme for longest-matching prefix , 2001, Proceedings 2001 International Conference on Computer Networks and Mobile Computing.

[6]  Shou-Yu Pin,et al.  A fast IP lookup scheme for high speed routers , 2005 .

[7]  Edward Fredkin,et al.  Trie memory , 1960, Commun. ACM.

[8]  Jürgen Falb,et al.  The Internet Protocol , 2005, The Industrial Information Technology Handbook.

[9]  Nen-Fu Huang,et al.  A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers , 1999, IEEE J. Sel. Areas Commun..

[10]  Vince Fuller,et al.  Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy , 1993, RFC.

[11]  Gunnar Karlsson,et al.  IP-address lookup using LC-tries , 1999, IEEE J. Sel. Areas Commun..

[12]  Nick McKeown,et al.  Routing lookups in hardware at memory access speeds , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

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