Name
Abstract | ||
|---|---|---|
Ternary Content Addressable Memories (TCAMs) are massively parallel search engines enabling the usage of "don't care" wildcards when searching for data. TCAMs are used in a wide variety of applications, such as routing tables for IP forwarding, which have been recently implemented using FPGAs. However, traditional "brute force" CAM architectures that use FPGA SRAM blocks (BRAMs) involve swapping address and data lines and are very inefficient. In this paper, a novel, efficient and modular technique for Longest-Prefix Match (LPM) TCAMs using FPGA BRAMs is proposed. Hierarchical search is exploited to achieve a linear storage growth and high storage efficiency. Compared to other methods, our LPM-TCAM design accommodates 5.5x more data for the same SRAM area without degrading the performance. A fully parameterized Verilog implementation is being released as an open source library. The library has been extensively tested using Altera's Quartus and ModelSim. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/FPL.2018.00049 | 2018 28th International Conference on Field Programmable Logic and Applications (FPL) |
Keywords | Field | DocType |
ternary content addressable memory, associative memory, longest-prefix match, routing table, packet forwarding | ModelSim,Computer science,Massively parallel,Parallel computing,Field-programmable gate array,Longest prefix match,Modular design,Verilog,Routing table,IP forwarding | Conference |
ISSN | ISBN | Citations |
1946-147X | 978-1-5386-8518-1 | 0 |
PageRank | References | Authors |
0.34 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ameer Abdelhadi | 1 | 43 | 6.33 |
| Guy G. F. Lemieux | 2 | 179 | 14.96 |
| Lesley Shannon | 3 | 119 | 9.10 |