2002
DOI: 10.1109/mcom.2002.1046995
|View full text |Cite
|
Sign up to set email alerts
|

Novel hardware architecture for fast address lookups

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2004
2004
2007
2007

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 13 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…After matching three characters, fourth character from text ðText½d 1 þ 3 ¼ '9'Þ does not match with that of pattern ðPattern½3 ¼ '8'Þ: Again Step 3 comes into play and finds the mismatched character of pattern ðPattern½3 ¼ '8'Þ in text. '8' is found in Text [8] (Fig. 7(d)).…”
Section: A Comprehensive Illustrative Examplementioning
confidence: 74%
“…After matching three characters, fourth character from text ðText½d 1 þ 3 ¼ '9'Þ does not match with that of pattern ðPattern½3 ¼ '8'Þ: Again Step 3 comes into play and finds the mismatched character of pattern ðPattern½3 ¼ '8'Þ in text. '8' is found in Text [8] (Fig. 7(d)).…”
Section: A Comprehensive Illustrative Examplementioning
confidence: 74%
“…For the complex longest prefix matching, IP lookup is often designed in software at first. For example, many papers (Jia et al, 2003;Mehrotra Franzon, 2002;Pao et al, 2003;Sahni and Kim, 2003;Sklower, 1991) discuss how to build a binary trie (Sklower, 1991) or a multibit trie (Jia et al, 2003;Mehrotra and Fanzon, 2002;Pao et al, 2003;Sahni and Kim, 2003) to avoid visiting unrelated routing table entries while executing the lookup process.…”
Section: Introductionmentioning
confidence: 99%