Parallel IP Address Lookup using Hashing with Multiple SRAMs 


Vol. 28,  No. 2, pp. 138-143, Feb.  2003


PDF
  Abstract

One of the important design issues for IP routers responsible for packet forwarding in computer networks is the route-lookup mechanism. For each incoming packet, IP routing requires that a router performs a longest-prefix-match address lookup in order to determine the next hop that the incoming packet should be forwarded to. In this paper, we present a new scheme which applies the hashing function for IP address lookup. In the proposed scheme, the forwarding table is composed of multiple SRAMs, and each SRAM represents an address lookup table in each prefix. Hashing function is applied in order to find out the matching entries from the address lookup tables in parallel, and the entry with the longest prefix match among them is selected. Simulation using the MAE-WEST router example shows that a large routing table with 37000 entries can be compacted to a forwarding table of 300 Kbytes in the proposed scheme. It is also shown that the proposed scheme achieves one route lookup every 1.93 memory accesses in average.

  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]

J. Seo, H. Lim, Y. Jung, S. Lee, "Parallel IP Address Lookup using Hashing with Multiple SRAMs," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 2, pp. 138-143, 2003. DOI: .

[ACM Style]

Ji-Hyun Seo, Hye-Sook Lim, Yeo-Jin Jung, and Seung-Jun Lee. 2003. Parallel IP Address Lookup using Hashing with Multiple SRAMs. The Journal of Korean Institute of Communications and Information Sciences, 28, 2, (2003), 138-143. DOI: .

[KICS Style]

Ji-Hyun Seo, Hye-Sook Lim, Yeo-Jin Jung, Seung-Jun Lee, "Parallel IP Address Lookup using Hashing with Multiple SRAMs," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 2, pp. 138-143, 2. 2003.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880