.png){kind=icon}
Return
Elephant Flow Detection With Random Forest Models Under Programmable Network Dataplane Constraints
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2024.3485588.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper investigates the application of tree-based machine learning classifiers for flow-based traffic engineering, focusing on the binary classification of IP network flows into mice (short flows) and elephants (long flows) using 5-tuple header fields from the first packet. Unlike prior studies on network flow classification, our analysis uses performance metrics normalized by traffic coverage, ensuring relevance for traffic engineering and QoS applications. We also evaluate models within the constraints of programmable switching hardware, such as the Intel Tofino P4 chip. Our findings show that such constrained models can achieve high accuracy while performing inference at line rate in the dataplane. Additionally, we reveal a trade-off between tree depth and input format, with bit transformations enabling more efficient feature extraction at lower depths. Our results show that optimal tree depths range from 15 to 25 levels, depending on the input format. The most effective model employs extremely randomized trees with bit-transformed input and trees of depth 20.
Keywords:
Flows
elephant
classification
traffic engineering
traffic engineering
machine learning
machine learning
QoS
QoS
SDN
SDN
machine learning
QoS
SDN
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveNitric oxide‐induced bacteriostasis and modification of iron‐sulphur proteins in Escherichia coli
OAAI
OAAIShareSaveShareSaveShareSave
View more