2005
DOI: 10.1016/j.comcom.2004.12.019
|View full text |Cite
|
Sign up to set email alerts
|

Performance analysis of multi-dimensional packet classification on programmable network processors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
7
0

Year Published

2007
2007
2014
2014

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 13 publications
0
7
0
Order By: Relevance
“…Rashti et al [8] present a multidimensional packet classifier engine for NP-based firewalls, established on a hierarchical trie algorithm and on a technique of memory usage optimization. Srinivasan and Feng [9] study the performance of two different design mappings of the bit vector algorithm on the Intel IXP1200 NP. Hsu et al [10] propose a bit compression algorithm, also for Intel IXP1200, which requires few memory accesses and allows high performance.…”
Section: Related Workmentioning
confidence: 99%
“…Rashti et al [8] present a multidimensional packet classifier engine for NP-based firewalls, established on a hierarchical trie algorithm and on a technique of memory usage optimization. Srinivasan and Feng [9] study the performance of two different design mappings of the bit vector algorithm on the Intel IXP1200 NP. Hsu et al [10] propose a bit compression algorithm, also for Intel IXP1200, which requires few memory accesses and allows high performance.…”
Section: Related Workmentioning
confidence: 99%
“…with more than 10 6 filters) and 2-dimensional searches (such as FIS-tree, Tuple Space Search [15], etc). The problem with all the software approaches is that they cannot support more than 1Gbps rates even when executed on the state-of-the-art network processors [9], [18].…”
Section: Related Workmentioning
confidence: 99%
“…Srinivasan and W. Feng implemented the basic BitVector flow classification algorithm on the Intel IXP1200 network processor [23]. They compared parallel mapping and pipelined mapping of the algorithm and showed that parallel mapping has better processing rate.…”
Section: Related Work On Npmentioning
confidence: 99%