Advanced SearchSearch Tips
A Hybrid Prefix Cashing Scheme for Efficient IP Address Lookup
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
A Hybrid Prefix Cashing Scheme for Efficient IP Address Lookup
Kim, Jinsoo; Kim, Junghwan;
  PDF(new window)
We propose a hybrid prefix caching scheme to enable high speed IP address lookup. All prefixes loaded in a prefix cache should not be overlapped in address range for correct IP lookup. So, every non-leaf prefix needs to be expanded not so as to be overlapped. The shorter expanded prefix is more preferable because it can cover wider address range just as an single entry in a prefix cache. We exploits advantages of two dynamic prefix expansion techniques, bounded prefix expansion technique and bitmap-based prefix expansion technique. The proposed scheme uses dual bound values whereas just one bound value is used in bounded prefix expansion. Our elaborated technique make the dual bound values be associated with several subtries flexibly using bitmap information, rather than with fixed subtries. We evaluate the performance of the proposed scheme in terms of the average length of the expanded prefixes and cache miss ratio. The experiment results show the proposed scheme has lower cache miss ratio than other previous schemes including both bounded prefix expansion and bitmap-based expansion irrespective of the cache size.
IP address lookup;hybrid prefix cashing;prefix expansion;bitmap;dual bounds;
 Cited by
G. Varghese, "Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices," Morgan Kaufmann, 2005.

Mi. A. Ruiz-Sanchez, E. W. Biersack, and W. Dabbous, "Survey and Taxonomy of IP Address Lookup Algorithms," IEEE Network, March/April 2001.

J. Kim and J. Kim, "Fast Prefix Deletion for Parallel TCAM-Based IP Address Lookup," Journal of The Korea Society of Computer and Information, Vol. 15, No. 12, pp. 93-100, Dec. 2010.

L. Luo, G. Xie, Y. Xie, L. Mathy, and K. Salamatian, "A Hybrid Hardware Architecture for High-Speed IP Lookups and Fast Route Updates," Proceedings of IEEE INFOCOM, pp. 2435-2443, 2012.

W. Shi, M. MacGregor, P. Gburzynski, "On temporal locality in IP address sequences," IEICE Transactions on Communications, E86-B (11), pp. 3352-3354, 2003.

B. Talbot, T. Sherwood, and B. Lin, "IP caching for terabit speed routers," Proc. of Global Telecommunications Conf., pp. 1565-1569, 1999.

H. Liu, "Routing prefix caching in network processor design," Proc. of International Conf. on Computer Communications and Networks, pp. 18-23, Oct. 2001.

M. J. Akhbarizadeh and M. Nourani, "Efficient prefix cache for network processors," Proc. of 12th Annual IEEE Symp. on High Performance Interconnects, pp. 41-46, Aug. 2004.

S. Kasnavi, P. Berube, V. Gaudet, and J. N. Amaral, "A cache-based internet protocol address lookup architecture," Computer Networks, vol. 52, no. 2, pp. 303-326, Feb. 2008. crossref(new window)

J. Kim, M. Park, S. Han, and J. Kim, "An efficient prefix caching scheme with bounded prefix expansion for high-speed IP lookup," IEICE Transactions on Communications, vol. E95-B, no. 10, pp.3298-3301, Oct. 2012. crossref(new window)

J Kim, M Park, S Han, and J Kim, "A Novel Controlled Bound Prefix Expansion for Prefix Caching in High-Speed IP Lookup," Journal of Next Generation Information Technology, Vol. 4, No. 7, pp. 61-69, Sep. 2013.

J. Kim, M.-C. Ko, J. Nam, and J. Kim, "Bitmap-based Prefix Caching for Fast IP Lookup," KSII Tr. on Internet and Information Systems, vol. 8, no. 3, pp.873-889, Mar. 2014. crossref(new window)

APNIC prefix table,