A longest prefix first search tree for IP lookup

Authors:
Lih-Chyau Wuu;Tzong-Jye Liu;Kuo-Ming Chen
Affiliations:
Institute of Computer Science, National Yunlin University of Science and Technology, Taiwan, ROC;Department of Information Engineering and Computer Science, Feng Chia University, Taiwan, ROC;Institute of Computer Science, National Yunlin University of Science and Technology, Taiwan, ROC
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2007

Citing 5
Cited 2

Small forwarding tables for fast routing lookups

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Trie memory

Communications of the ACM
IP-address lookup using LC-tries

IEEE Journal on Selected Areas in Communications
A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers

IEEE Journal on Selected Areas in Communications
Survey and taxonomy of IP address lookup algorithms

IEEE Network: The Magazine of Global Internetworking

An efficient IP address lookup algorithm based on a small balanced tree using entry reduction

Computer Networks: The International Journal of Computer and Telecommunications Networking
A high-throughput and high-capacity IPv6 routing lookup system

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The IP lookup mechanism is a key issue, in the design of IP routers. IP lookup is an important action in a router, which finds the next hop of each incoming packet with a longest-prefix-match address in the routing table. This work places the routing table on a longest prefix first search tree, which is constructed as a heap-like structure by the prefix length. A router using this scheme has fewer memory accesses when executing IP lookup than a router designed according to the Trie [E. Fredkin, Trie Memory, Communication of the ACM 3 (1960) 490-500], Patricia [K. Sklower, A tree-based routing table for Berkeley Unix, in: Proceedings of the USENIX Conference, 1991, pp. 93-99] or Prefix tree [M. Berger, IP lookup with low memory requirement and fast update, in: Proceedings of IEEE High Performance Switching and Routing, 2003, pp. 287-291]. Some nodes of the proposed tree can include two entries of the routing table to decrease the number of tree nodes. For instance, a routing table with 163,695 entries can be held in the proposed tree with 156,191 nodes. Furthermore, an improved scheme is presented to partition a tree into several smaller trees. The simulation reveals that the scheme not only lowers the tree height effectively but also scales well to IPv6 addresses.