DocumentCode
2779053
Title
FPGA implementation of lookup algorithms
Author
Chicha, Zoran ; Milinkovic, Luka ; Smiljanic, Aleksandra
Author_Institution
Dept. of Telecommun., Belgrade Univ., Belgrade, Serbia
fYear
2011
fDate
4-6 July 2011
Firstpage
270
Lastpage
275
Abstract
The pool of available IPv4 addresses is being depleted, comprising less than 10% of all IPv4 addresses. At the same time, the bit-rates at which packets are transmitted are increasing, and the IP lookup speed must be increased as well. Consequently, the IP lookup algorithms are in the research focus again because the existing solutions were designed for IPv4 addresses, and are not sufficiently scalable. In this paper, we compare FPGA implementations of the balanced parallelized frugal lookup (BPFL) algorithm, and the parallel optimized linear pipeline (POLP) lookup algorithm that efficiently use the memory, and achieve the highest speeds.
Keywords
IP networks; field programmable gate arrays; packet switching; table lookup; FPGA; IP lookup algorithms; IPv4 addresses; balanced parallelized frugal lookup algorithm; packet transmission; parallel optimized linear pipeline lookup algorithm; Field programmable gate arrays; IP networks; Memory management; Pipeline processing; Pipelines; Search engines; System-on-a-chip; FPGA; IP lookup; Internet router;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Switching and Routing (HPSR), 2011 IEEE 12th International Conference on
Conference_Location
Cartagena
Print_ISBN
978-1-4244-8454-6
Electronic_ISBN
978-1-4244-8455-3
Type
conf
DOI
10.1109/HPSR.2011.5986037
Filename
5986037
Link To Document