IP lookup with low memory requirement and fast update

The paper presents an IP address lookup algorithm with low memory requirement and fast updates. The scheme, which is denoted prefix-tree, uses a combination of a trie and a tree search, which is efficient in memory usage because the tree contains exactly one node for each prefix in the routing table. The time complexity for update operations is low for the prefix-tree. The lookup operation for the basic binary prefix-tree may require that a high number of nodes be traversed. The paper presents improvements to decrease lookup time, including shortcut tables and multi-bit trees. The prefix-tree is compared to a trie and a path compressed trie using prefixes from a real routing table.

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

[2]  Robert Sedgewick,et al.  Algorithms in C , 1990 .

[3]  Martina Zitterbart,et al.  High–performance routing–table lookup , 2000, Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[4]  Thomas M. Chen,et al.  ATM switching systems , 1995 .

[5]  Kohei Shiomoto,et al.  A fast and compact longest match prefix look-up method using pointer cache for very long network address , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[6]  Farnam Jahanian,et al.  Internet routing instability , 1997, SIGCOMM '97.

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