Title :
A scalable and small forwarding table for fast IP address lookups
Author :
Sungkee, J. ; Chung, Sang-Hun ; Cho, Jung-wdn ; Yoon, Hyunsoo
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., KAIST, Taejon, South Korea
Abstract :
IP address lookup is an important design issue for the high performance Internet routers. The most important function of routers is to determine the output port of an incoming IP packet according to its destination address. In this paper, we propose a scalable and simple forwarding table structure for fast hardware-based IP address lookup which reduces memory requirements and memory access times. Proposed scheme requires maximum two memory access times in the worst case to finish an IP address lookup. And it consumes about 0.6 ~ 1.1 M Bytes memory for large routing tables with 16,000 ~ 43,000 routing prefixes when any compression method is not used
Keywords :
Internet; packet switching; table lookup; telecommunication network routing; IP address lookup; Internet; Internet routers; forwarding table; memory access times; memory requirements; packet switched networks; Computer science; Copper; Delay; IP networks; Information technology; Packet switching; Routing; Search engines; Web and internet services; Wires;
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.962626
