1992
DOI: 10.1109/65.120723
|View full text |Cite
|
Sign up to set email alerts
|

Putting routing tables in silicon

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

1999
1999
2023
2023

Publication Types

Select...
4
3
3

Relationship

0
10

Authors

Journals

citations
Cited by 71 publications
(15 citation statements)
references
References 9 publications
0
15
0
Order By: Relevance
“…The reason is the removal of the prioritizer circuit from critical path of the RCAM architecture. Analytically, the overall search time of RCAM architecture is given by: t rcam search 2t rcam block + t encoder (5) where, t rcam block is the delay of the RCAM block (n × w cells) and t encoder is the delay of a regular n-input encoder logic. The analytical expression for the overall search time of a conventional TCAM architecture is given by: t tcam search t tcam block + t priority encoder (6) where, t tcam block is the delay of the TCAM block (n × w cells) and t priority encoder is the delay of a n-input priority encoder logic.…”
Section: A Search Timementioning
confidence: 99%
“…The reason is the removal of the prioritizer circuit from critical path of the RCAM architecture. Analytically, the overall search time of RCAM architecture is given by: t rcam search 2t rcam block + t encoder (5) where, t rcam block is the delay of the RCAM block (n × w cells) and t encoder is the delay of a regular n-input encoder logic. The analytical expression for the overall search time of a conventional TCAM architecture is given by: t tcam search t tcam block + t priority encoder (6) where, t tcam block is the delay of the TCAM block (n × w cells) and t priority encoder is the delay of a n-input priority encoder logic.…”
Section: A Search Timementioning
confidence: 99%
“…Hardware route lookup and forwarding is also under active investigation in both research and commercial designs [30,31]. The argument for a software-based implementation stresses¯exibility.…”
Section: Route Lookupmentioning
confidence: 99%
“…In addition to the algorithmic and software approaches on LUT search, some researchers offered hardware solutions. For example, [12] proposes hardware implementation of tries of high radix for exact matching and [13] uses internal SRAMs for the entire routing table. Also, using content-addressable memory (CAM) and utilizing the cache are proposed in [14] and [13], respectively.…”
Section: A Prior Work and Main Contributionmentioning
confidence: 99%