Browse > Article

A Bit-Map Trie for the High-Speed Longest Prefix Search of IP Addresses  

오승현 (동국대학교 컴퓨터학과)
안종석 (동국대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Information Networking / v.30, no.2, 2003 , pp. 282-292 More about this Journal
Abstract
This paper proposes an efficient data structure for forwarding IPv4 and IPv6 packets at the gigabit speed in backbone routers. The LPM(Longest Prefix Matching) search becomes a bottleneck of routers' performance since the LPM complexity grows in proportion to the forwarding table size and the address length. To speed up the forwarding process, this paper introduces a data structure named BMT(Bit-Map Tie) to minimize the frequent main memory accesses. All the necessary search computations in BMT are done over a small index table stored at cache. To build the small index table from the tie representation of the forwarding table, BMT represents a link pointer to the child node and a node pointer to the corresponding entry in the forwarding table with one bit respectively. To improve the poor performance of the conventional tries when their height becomes higher due to the increase of the address length, BMT adopts a binary search algorithm for determining the appropriate level of tries to start. The simulation experiments show that BMT compacts the IPv4 backbone routers' forwarding table into a small one less than 512-kbyte and achieves the average speed of 250ns/packet on Pentium II processors, which is almost the same performance as the fastest conventional lookup algorithms.
Keywords
router; gigabit; forwarding lookup; trie; LPM;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Peter Newman, Greg Minshall, and Larry Huston, 'IP Switching and Gigabit Routers,' IEEE Communications Magazine, January 1997   DOI   ScienceOn
2 Keith Sklower, 'A Tree-Based Routing Table for Berkeley Unix,' Technical report, University of California, Berkeley
3 David C. Feldmeier, 'Improving gateway performance with a routing-table cache,' In proceedings of IEEE Infocom'98, New Orleans, Louisiana, March 1998   DOI
4 Anthony J. Bloomfeld NJ McAuley, Paul F. Lake Hopatcong NJ Tsuchiya, and Daniel V. Rockaway Township Morris Country NJ Wilson, 'Fast Mul-tilevel hierarchial routing table using content-addressable memory,' U.S. Patent serial number 034444
5 Pinar A. Yilmaz, Andrey Belenkiy, Necdet Uzun, and Nitin Gogate, A Trie-based Algorithm for IP Lookup Problem, In Proceedings of Globecom'00, 2000   DOI
6 A. Brernler-Barr, Y. Afek, and S. Har-Peled, 'Routing with Clue,' In Proceedings of ACM SIGCOMM 99, Cambridge, September 1999
7 E. Rosen, et al., 'Multiprotocol Label Switching Architecture,' ftp://ds.internic.net/internet-drafts/ draft-ietf-mpls-arch-07.txt, July 2000
8 Yakov Rekhter et aI, 'Tag switching architecture overview, 'ftP://ds.internic.net/internet-drafts/draft-rfcedinfo-rekhter-00.txt, 1996
9 Donald R. Morrison, 'PATRICIA-Practical Algorithm to Retrieve Information Coded In Alfanumeric,' journal of the ACM, 15(4):514-534, October 1968   DOI
10 Mikael Degermark, Andrej Brodnik, Svante Carlsson, and Stephen pink, 'Small Forwarding Tables for Fast Routing Lookups,' In Proceedings of ACM SIGCOMM'97, October 1997   DOI
11 B. Lampson, V. Srinivasan and G. Varghese, 'IP Lookups using Multiway and Multicolumn Search,' In Proceeding of INFOCOM'98, March 1998   DOI
12 S. Venkatachary and G. Varghese, 'Faster IP Lookups using Controlled Prefix Expansion,' In Proceedings of ACM Sigmetrics'98, June 1998   DOI
13 Y. Rekhter and T. Li. 'A Border Gateway Protocol 4 (BGP-4),' IETF RFC 1771, March 1995
14 Marcel Waldvogel, George Varghese, Jon Turner, and Bernhard Plattner, 'Scalable High Speed IP Routing Lookups,' In Proceedings of ACM SIGCOMM'97, October 1997   DOI
15 P. Gupta, et al., 'Routing Lookups in Hardware at Memory Access Speeds,' In Proceedings of IEEE Infocom'98, San Francisco, April 1998   DOI
16 A. Moestedt, et al., 'IP Address Lookup in Hardware for High-Speed Routing,' Hot Interconnects, August 1998
17 Peter Newman, Tom Lyon, and Greg Minshall, 'Flow labeled IP: a connectionless approach to ATM,' In Proceedings of IEEE Infocom'96, San Francisco, California, March 1996   DOI
18 Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, 'Data Structure and Algorithms,' Addison-Wesley, 1983
19 Michigan University and merit Network, Internet Performance Management and Analysis (IPMA) project, http://nic.rnerit.edu/~ipma
20 S. Nilsson and G. karlsson, 'Fast Address Look-Up for Internet Routers,' In Proceedings of IEEE Broadband Communications '98, April 1998
21 T. Kijkanjanarat and H.J,Chao, 'Fast IP Lookups using a Two-Trie Data Structure,' In Proceedings of Globecom'99, 1999   DOI
22 오승현, 안종석, '고속 라우터의 기가비트 포워딩 검색을 위한 비트-맵 트라이 구조', 정보과학회 논문지: 정보통신, 2001   과학기술학회마을
23 S. Deering, and R. Hinden, 'Internet Protocol, Version 6 (IPv6) Specification,' IETF RFC 2460, December 1998
24 www.intel.com/design/Pentiumll/