Binary Search on Multiple Small Trees for IP Address Lookup 


Vol. 29,  No. 12, pp. 1642-1651, Dec.  2004


PDF Full-Text
  Abstract

Advance of internet access technology requires more internet bandwidth and high-speed packet processing IP address lookups in routers are essential elements which should be performed in real time for packets arriving tens-of-milion packets per second. In this paper, we proposed a new architecture for efficient IP address lookup. The proposed scheme produces multiple balanced trees stored into a single SRAM. The proposed scheme performs sequential binary searches on multiple trees. Performance evaluation results show that proposed architecture requires 301.7KByte SRAM to store about 40,000 prefix samples, and an address lookup is achieved by 11.3 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]

B. Lee, H. Lim, W. Kim, "Binary Search on Multiple Small Trees for IP Address Lookup," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 12, pp. 1642-1651, 2004. DOI: .

[ACM Style]

Bomi Lee, Hyesook Lim, and Wonjung Kim. 2004. Binary Search on Multiple Small Trees for IP Address Lookup. The Journal of Korean Institute of Communications and Information Sciences, 29, 12, (2004), 1642-1651. DOI: .

[KICS Style]

Bomi Lee, Hyesook Lim, Wonjung Kim, "Binary Search on Multiple Small Trees for IP Address Lookup," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 12, pp. 1642-1651, 12. 2004.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880