A Parallel IP Address Lookup Scheme for High-Speed Routers


The KIPS Transactions:PartA, Vol. 11, No. 5, pp. 333-340, Oct. 2004
10.3745/KIPSTA.2004.11.5.333,   PDF Download:

Abstract

In order that routers forward a packet to its destination, they perform IP address lookup which determines the next hop according to the packet's destination address. In designing high speed routers, IP address lookup is an important issue. In order to design high speed routers, this paper proposes a parallel IP lookup scheme which consists of several IP lookup engines without any modification of already fabricated indirect IP lookup chipsets. Also, we propose a simple rule for partitioning IP prefix entries in an overall forwarding table among several IP lookup engines. And we evaluate the performance of the proposed scheme in terms of the memory size required for storing lookup information and the number of memory accesses on constructing the forwarding table. With additional hardware logics, the proposed scheme can reduce about 30% of the required memory size and 80% of the memory access counts.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
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. H. Park, M. Y. Chung, J. S. Kim, Y. G. Won, "A Parallel IP Address Lookup Scheme for High-Speed Routers," The KIPS Transactions:PartA, vol. 11, no. 5, pp. 333-340, 2004. DOI: 10.3745/KIPSTA.2004.11.5.333.

[ACM Style]
Jae Hyung Park, Min Young Chung, Jin Soo Kim, and Yong Gwan Won. 2004. A Parallel IP Address Lookup Scheme for High-Speed Routers. The KIPS Transactions:PartA, 11, 5, (2004), 333-340. DOI: 10.3745/KIPSTA.2004.11.5.333.