SpliDT partitions decision trees into subtrees, processes flows in windows, and reuses switch registers via recirculation, supporting up to 5x more stateful features than NetBeacon and Leo with higher F1 at similar flow counts.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NI 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate
SpliDT partitions decision trees into subtrees, processes flows in windows, and reuses switch registers via recirculation, supporting up to 5x more stateful features than NetBeacon and Leo with higher F1 at similar flow counts.