Hardware based set-associative IP address lookup scheme 


Vol. 30,  No. 8, pp. 541-548, Aug.  2005


PDF
  Abstract

IP lookup and forwarding process becomes the bottleneck of packet transmission as IP traffic increases. Previous hardware-based IP address lookup schemes using an index-based table are not memory-efficient due to sparse distribution of the routing prefixes. In this paper, we propose memory-efficient hardware based IP lookup scheme called set-associative IP address lookup scheme, which provides the same IP lookup speed with much smaller memory requirement. In the proposed scheme, an NHA entry stores the prefix and next hop together. The IP lookup procedure compares a destination IP address with eight entries in a corresponding set simultaneously and finds the longest matched prefix. The memory requirement of the proposed scheme is about 42% of that of Lin's scheme. Thus, the set-associative IP address lookup scheme is a memory-efficient hardware based IP address lookup scheme.

  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]

S. Yun, "Hardware based set-associative IP address lookup scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 8, pp. 541-548, 2005. DOI: .

[ACM Style]

Sang-Kyun Yun. 2005. Hardware based set-associative IP address lookup scheme. The Journal of Korean Institute of Communications and Information Sciences, 30, 8, (2005), 541-548. DOI: .

[KICS Style]

Sang-Kyun Yun, "Hardware based set-associative IP address lookup scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 8, pp. 541-548, 8. 2005.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880