Title :
A fast IP lookup scheme for longest-matching prefix
Author :
Wuu, Lih-Chyau ; Pin, Shou-Yu
Abstract :
One of the key design issues for the next generation 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 propose an IP lookup mechanism with the number of memory access for an IP lookup being one in the best case and being four in the worst case. The forwarding table needed by our mechanism is small enough to fit in the SRAM. For example, a large routing table with 40000 routing entries can be compacted to a forwarding table of 260 K Bytes in our scheme
Keywords :
Internet; packet switching; telecommunication network routing; tree data structures; tree searching; IP lookup; IP routers; forwarding table; longest-prefix-match address; routing table; Bandwidth; Design engineering; Hardware; IP networks; Internet; Network address translation; Optical fiber cables; Random access memory; Routing; Telecommunication traffic;
Conference_Titel :
Computer Networks and Mobile Computing, 2001. Proceedings. 2001 International Conference on
Conference_Location :
Los Alamitos, CA
Print_ISBN :
0-7695-1381-6
DOI :
10.1109/ICCNMC.2001.962625
