High-speed IP address lookup using balanced multi-way trees

Authors:
Hyesook Lim;Wonjung Kim;Bomi Lee;Changhoon Yim
Affiliations:
Department of Information Electronics, Ewha Womans University, Seoul, Republic of Korea;Department of Information Electronics, Ewha Womans University, Seoul, Republic of Korea;Digital Media Research Center, MCT Group, LG Electronics, Seoul, Republic of Korea;Department of Internet and Multimedia, Konkuk University, Seoul, Republic of Korea
Venue:
Computer Communications
Year:
2006

Citing 6
Cited 0

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
Scalable high speed IP routing lookups

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Faster IP lookups using controlled prefix expansion

SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
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

Quantified Score

Hi-index	0.24

Visualization

Abstract

Rapid growth of the Internet traffic requires more bandwidth and high-speed packet processing in the Internet routers. As one of the major packet processing performed in routers, address lookup determines an output port using the destination IP address of incoming packets. Since routers should perform address lookups in real-time for hundred millions of incoming packets per second referring a huge routing table, address lookup is one of the most challenging operations. In this paper, we propose a multi-way search architecture for IP address lookup which shows very good performance in search speed. The performance evaluation results show that the proposed scheme requires a single 282kbyte SRAM to store about 40,000 routing entries, and an address lookup is achieved by 5.9 memory accesses in average.