2014
DOI: 10.1109/lcomm.2014.013114.132384
|View full text |Cite
|
Sign up to set email alerts
|

A Quad-Trie Conditionally Merged with a Decision Tree for Packet Classification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…It leads to a decision tree data structure that can be optimised to yield good search complexity even in very big rule lists (in the order of 100000 rules). A heuristic approach is explored in [20], by looking for a compromise between memory efficient trie data structures and search efficient decision trees. Detection of specific packets is considered in [21], where a randomised algorithm is considered: the emphasis here is placed on isolating specifically targeted packets from the mass of the wire traffic.…”
Section: Related Workmentioning
confidence: 99%
“…It leads to a decision tree data structure that can be optimised to yield good search complexity even in very big rule lists (in the order of 100000 rules). A heuristic approach is explored in [20], by looking for a compromise between memory efficient trie data structures and search efficient decision trees. Detection of specific packets is considered in [21], where a randomised algorithm is considered: the emphasis here is placed on isolating specifically targeted packets from the mass of the wire traffic.…”
Section: Related Workmentioning
confidence: 99%