Browse > Article

Weighted Binary Prefix Tree for IP Address Lookup  

Yim Changhoon (건국대학교 정보통신대학 인터넷미디어공학부)
Lim Hyesook (이화여자대학교 공과대학 정보통신학과 SoC설계연구실)
Lee Bomi (건국대학교 정보통신대학 인터넷미디어공학부)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.29, no.11B, 2004 , pp. 911-919 More about this Journal
Abstract
IP address lookup is one of the essential functions on internet routers, and it determines overall router performance. The most important evaluation factor for software-based IP address lookup is the number of the worst case memory accesses. Binary prefix tree (BPT) scheme gives small number of worst case memory accesses among previous software-based schemes. However the tree structure of BPT is normally unbalanced. In this paper, we propose weighted binary prefix tree (WBP) scheme which generates nearly balanced tree, through combining the concept of weight to the BPT generation process. The proposed WBPT gives very small number of worst case memory accesses compared to the previous software-based schemes. Moreover the WBPT requires comparably small size of memory which can be fit within L2 cache for about 30,000 prefixes, and it is rather simple for prefix addition and deletion. Hence the proposed WBPT can be used for software-based If address lookup in practical routers.
Keywords
IP address lookup; longest prefix matching; binary prefix tree; weighted binary prefix tree; balanced tree; enclosure prefix; enclosed prefix;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 M.A. Ruiz-Sanchex, E.W. Biersack, and W. Dabbous, 'Survey and Taxonomy of IP Address Lookup Algorithms,' IEEE Network, pp.8-23, March/April 2001
2 N. Yazdani and P. S. Min, 'Fast and Scalable Schemes for the IP Address Lookup Problem,' Proc. IEEE HPSR2000, pp 83-92, 2000
3 Mohammad Peyravian, Gordon Davis, and Jean Calvignac, 'Search Engine Implications for Network Processor Efficiency,' IEEE Network, pp.12-20, July/August 2003
4 정여진, 이보미, 임혜숙, '복수의 해쉬 함수를 이용한 병렬 IP 어드레스 검색 구조,' 한국통신학회 논문지, 29권, 2B호, pp.158-166, 2004
5 M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, 'Scalable High Speed IP Routing Lookups,' in Proc. ACM SIGCOMM'97 Conf., pp. 25-35, 1997
6 D. Yu, B. C. Smith, and B. Wei, 'Forwarding Engine for Fast Routing Lookups and Updates,' Proc.IEEE GLOBECOM'99, pp.1556-1564, 1999
7 B. Lampson, V. Srinivasan, and G. Varghese, 'IP Lookups Using Multiway and Multicolumn Search', IEEE/ACM Transactions on Networking, pp 324-334, Vol.7, No.3, Jun. 1999   DOI   ScienceOn
8 S. Nilsson and G. Karlsson, 'IP-Address Lookup using LC-tries,' IEEE Journal on Selected Area in Communication, Vol. 17, pp.1083-1092, June 1999   DOI   ScienceOn
9 P. Gupta, S. Lin, and N. McKeown, 'Routing lookups in hardware at memory access speed,' Proc. IEEE INFOCOM'98, pp 1240-1247, ARP 1998
10 H.J. Chao, 'Next Generation Routers,' Proceedings of the IEEE, Vo1.90, No.9, pp.1518-1558, Sep, 2002   DOI   ScienceOn
11 V. Srinivasan and G. Varghese, 'Faster IP Lookup using Controlled Preftx Expansion,' in Proc. ACM SIGMATICS'98, pp.1-1O, June 1998
12 M. Degennark, A. Brodnik, S. Carlsson, and S. Pink, 'Small Forwarding Tables for Fast Routing Lookups,' Proc. ACM SIGCOMM, pp.3-14, 1997
13 H. Lim and B. Lee, 'A New Pipelined Binary Search Architecture for IP Address Lookup', Proc. IEEE HPSR2004, pp.86-90, Apr. 2004