Browse > Article

Binary Search on Tree Levels for IP Address Lookup  

Mun, Ju-Hyoung (이화여자대학교 정보통신학과 SoC설계연구실)
Lim, Hye-Sook (이화여자대학교 정보통신학과 SoC설계연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.31, no.2B, 2006 , pp. 71-79 More about this Journal
Abstract
Address lookup is an essential function in the Internet routers, and it determines overall router performance. In this paper, we have thoroughly investigated the binary-search-based address lookup algorithms and proposed a new algorithm based on binary search on prefix lengths. Most of the existing binary search schemes perform binary search on prefix values, and hence the lookup speed is proportional to the length of prefixes or the log function of the number of prefixes. The previous algorithm based on binary search on prefix lengths has superior lookup performance than others. However, the algorithm requires very complicated pre-computation of markers and best matching prefixes in internal nodes since naive binary search is not possible in their scheme. This complicated pre-computation makes the composition of the routing table and incremental update very difficult. By using leaf-pushing, the proposed algorithm in this paper removes the complicated pre-computation of the Previous work in performing the binary search on prefix lengths. The performance evaluation results show that the proposed scheme has very good performance in lookup speed compared with previous works.
Keywords
Address lookup; Internet Protocol; Binary Trie; Binary Search on length;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Changhoon Yim, Bomi Lee, and Hyesook Lim, 'Efficient Binary Search for IP Address Lookup', IEEE Communications Letters, vol. 9, no. 7, pp.652-654, Jul. 2005   DOI   ScienceOn
2 V. Srinuvasan and G. Varghese, 'Fast Address Lookups Using Controlled Prefix Expansion', ACM Transactions on Computer Systems, Vol. 17, No. 1, pp.1-40, Feb. 1999   DOI   ScienceOn
3 Merit Networks, Inc. http://www. merit. edu
4 H. Lim and Y. Jung, 'A Parallel Multiple Hashing Architecture for IP Address Lookup', Proc. IEEE HPSR2004, pp.91-98, Apr. 2004
5 B. Lampson, V. Srinivasan, and G. Varghese, 'IP Lookups Using Multiway and Multicolumn Search', IEEE/ACM Transactions on Networking, vol.7, no.3, pp.324- 334, Jun. 1999   DOI   ScienceOn
6 M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, 'Scalable high speed IP routing lookups', in Proc. ACM SIGCOMM Conf., Cannes, France, pp.25-35, 1997   DOI
7 Hyesook Lim, Bomi Lee, and Won-Jung Kim, 'Binary Searches on Multiple Small Trees for IP Address Lookup', IEEE Communications Letters, vol.9, no. 1, pp.75-77, Jan. 2005   DOI   ScienceOn
8 N. Yazdani and P. S. Min, 'Fast and Scalable Schemes for the IP Address Look-up Problem', Proc. IEEE HPSR2000, pp. 83-92, 2000
9 Hyesook Lim, Wonjung Kim, and Bomi Lee, 'Binary Search in a Balanced Tree for IP Address Lookup', Proc. IEEE HPSR2005, May 2005
10 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