2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC) 2012
DOI: 10.1109/iwcmc.2012.6314245
|View full text |Cite
|
Sign up to set email alerts
|

Hardware acceleration of SVM-based traffic classification on FPGA

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

2013
2013
2020
2020

Publication Types

Select...
4
2
2

Relationship

2
6

Authors

Journals

citations
Cited by 22 publications
(15 citation statements)
references
References 30 publications
0
15
0
Order By: Relevance
“…However, this increases the cycles needed to process a single vector. Hence, works that utilize such architectures have optimized it specifically for the vector dimensionality of the given problem and have been restricted to small scale data, with only a few hundred vectors and low dimensionality [9], [19], [20], and small-scale multiclass implementations [21] in order to be able to meet real-time constraints. In addition, these architectures cannot trade-off processing more SVs rather than vector elements, and hence, cannot efficiently deal with the different computational demands of the cascade SVM stages.…”
Section: Related Workmentioning
confidence: 99%
“…However, this increases the cycles needed to process a single vector. Hence, works that utilize such architectures have optimized it specifically for the vector dimensionality of the given problem and have been restricted to small scale data, with only a few hundred vectors and low dimensionality [9], [19], [20], and small-scale multiclass implementations [21] in order to be able to meet real-time constraints. In addition, these architectures cannot trade-off processing more SVs rather than vector elements, and hence, cannot efficiently deal with the different computational demands of the cascade SVM stages.…”
Section: Related Workmentioning
confidence: 99%
“…When the vector dimensionality is high and the hardware resources are not available for a full parallel processing the architecture can be folded to process the elements in groups, however, this increases the cycles needed to process a single vector. Hence, works that utilize such architectures have optimized it specifically for the vector dimensionality of the given problem and have been restricted to small scale data, with only a few hundred vectors and low dimensionality(~100 elements) [10], [24], [25] and small-scale multiclass implementations [26] in order to be able to meet real-time constraints. In addition, these architectures cannot trade-off processing more SVs rather than vector elements, and hence, cannot efficiently deal with the different computational demands of the cascade SVM stages.…”
Section: Related Workmentioning
confidence: 99%
“…We used 6 flowlevel features in Table I; they demonstrate high classification accuracy with a reasonable hardware complexity [1], [7], [8]. Our classification engine classifies network traffic into 8 categories [18], including web, P2P download, direct download, streaming, game, mail, instant messaging, and distant control. We used a publicly available traffic trace provided by Tstat [19]; note the throughput performance of our classification engine does not depend on the traffic trace.…”
Section: Evaluation a Experimental Setupmentioning
confidence: 99%