A Parallel Multiple Hashing Architecture Using Prefix Grouping for IP Address Lookup 


Vol. 30,  No. 3, pp. 65-71, Mar.  2005


PDF
  Abstract

The primary function of the Internet routers is to forward incoming packets toward their final destinations. IP address lookup is one of the most important functions in evaluating router performance since IP address lookup should be performed in wire-speed for the hundred-millions of incoming packets per second. With CIDR, the IP prefixes of routing table have arbitrary lengths, and hence address lookup by exact match is no longer valid. As a result, when packets arrive, routers compare the destination IP addresses of input packets with all prefixes in its routing table and determine the most specific entry among matching entries, and this is called the longest prefix matching. In this paper, based on parallel multiple hashing and prefix grouping, we have proposed a hardware architecture which performs an address lookup with a single memory access.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. r. Kim, Y. j. Jung, C. h. Yim, H. s. Lim, "A Parallel Multiple Hashing Architecture Using Prefix Grouping for IP Address Lookup," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 3, pp. 65-71, 2005. DOI: .

[ACM Style]

Hye ran Kim, Yeo jin Jung, Chang hoon Yim, and Hye sook Lim. 2005. A Parallel Multiple Hashing Architecture Using Prefix Grouping for IP Address Lookup. The Journal of Korean Institute of Communications and Information Sciences, 30, 3, (2005), 65-71. DOI: .

[KICS Style]

Hye ran Kim, Yeo jin Jung, Chang hoon Yim, Hye sook Lim, "A Parallel Multiple Hashing Architecture Using Prefix Grouping for IP Address Lookup," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 3, pp. 65-71, 3. 2005.