Browse > Article

Optimized Binary-Search-on- Range Architecture for IP Address Lookup  

Park, Kyong-Hye (이화여자대학교 SoC Desing Lab.)
Lim, Hye-Sook (이화여자대학교 SoC Desing Lab.)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.33, no.12B, 2008 , pp. 1103-1111 More about this Journal
Abstract
Internet routers forward an incoming packet to an output port toward its final destination through IP address lookup. Since each incoming packet should be forwarded in wire-speed, it is essential to provide the high-speed search performance. In this paper, IP address lookup algorithms using binary search are studied. Most of the binary search algorithms do not provide a balanced search, and hence the required number of memory access is excessive so that the search performance is poor. On the other hand, binary-search-on-range algorithm provides high-speed search performance, but it requires a large amount of memory. This paper shows an optimized binary-search-on-range structure which reduces the memory requirement by deleting unnecessary entries and an entry field. By this optimization, it is shown that the binary-search-on-range can be performed in a routing table with a similar or lesser number of entries than the number of prefixes. Using real backbone routing data, the optimized structure is compared with the original binary-search-on-range algorithm in terms of search performance. The performance comparison with various binary search algorithms is also provided.
Keywords
IP address lookup; Binary search on range; Longest prefix match;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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
2 J. Mun, H. Lim, and C. Yim, "Binary Search on Prefix Lengths for IP Address Lookup," IEEE Communications Letters., Vol.10, No.6, pp.492-494, June. 2006   DOI   ScienceOn
3 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
4 http://www.potaroo.net
5 B. Lampson, V. Srinivasan, and G. Varghese, "IP lookups using multiway and multicolumn search," IEEE/ACM Trans. Networking, Vol.7, No.3, pp.324-334, Jun. 1999   DOI   ScienceOn
6 H. J. Chao, "Next generation routers," Proceedings of the IEEE, Vol.90, No.9, pp.1518-1558, Sep. 2002   DOI   ScienceOn
7 N. Yazdani and P. S. Min, "Fast and scalable schemes for the IP address lookup problem," Proc. IEEE HPSR2000, pp. 83-92, 2000
8 HyeSook Lim, JuHyoung Mun, "An Efficient IP Address Lookup Algorithm Using a Priority Trie", GLOBECOM 2006
9 Hyun-Sic Kim, Hyuntae Park, Daein Kang and Sungho Kang, "A New Efficient Binary Search on Range for IP Address Lookup", 2006 International SoC Design Conference, pp.39-42, 2006
10 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
11 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