2018 28th International Conference on Field Programmable Logic and Applications (FPL) 2018
DOI: 10.1109/fpl.2018.00049
|View full text |Cite
|
Sign up to set email alerts
|

Modular Block-RAM-Based Longest-Prefix Match Ternary Content-Addressable Memories

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 5 publications
0
8
0
Order By: Relevance
“…If the implemented scale is required to expand, scalability‐friendly solutions can be considered. For example, the DDR or HBM‐based BCAM 26 can be used to implement the indirection table, and more resource‐efficient TCAM 27,28 can be used to implement the rule table. In the conditions above, we implement the design on Intel N3000, and the resource utilization is listed in Table 4.…”
Section: Methodsmentioning
confidence: 99%
“…If the implemented scale is required to expand, scalability‐friendly solutions can be considered. For example, the DDR or HBM‐based BCAM 26 can be used to implement the indirection table, and more resource‐efficient TCAM 27,28 can be used to implement the rule table. In the conditions above, we implement the design on Intel N3000, and the resource utilization is listed in Table 4.…”
Section: Methodsmentioning
confidence: 99%
“…After offloading, all packet processing related to the rule table is taken over by the FPGA, which can prevent overuse of the CPU cores to perform the IP searching and packet processing. Since the resource consumption linked to hardware implementation of the LPM table is extremely relevant to the width of the table [46], we do not implement the entire LPM table with the maximum IP width-that is, 128 bits for IPv6. Dividing the entire LPM table into two smaller tables with widths of 32 and 128 bits makes the implementation of LPM more resource-efficient.…”
Section: Offloading Lpm-based Cached-rule Table For Ip Routing Accelerationmentioning
confidence: 99%
“…Hardware-implemented TCAMs are able to search the whole memory space for a specific value within a single clock cycle due to their ability to perform a massively parallel search. There are two main implementation approaches of TCAM, namely registers-based and RAM-based, and the RAM-based solution is more applicable for large-scale implementation[46]. RAM-based TCAM is always implemented using the transposition method.…”
mentioning
confidence: 99%
“…Alternate approaches to TCAM include Z-TCAM, 17 Static Random Access Memory (SRAM)-based TCAM realization and indirect indexed TCAM. 18 However, most of these schemes are used to realize small-sized experimental TCAMs and do not seem to be suitable for practical deployments.…”
Section: Longest Prefix Matchingmentioning
confidence: 99%