REVIEW 2 cited by
AC-DC: Adaptive Ensemble Classification for Network Traffic Identification
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Accurate and efficient network traffic classification is important for many network management tasks, from traffic prioritization to anomaly detection. Although classifiers using pre-computed flow statistics (e.g., packet sizes, inter-arrival times) can be efficient, they may experience lower accuracy than techniques based on raw traffic, including packet captures. Past work on representation learning-based classifiers applied to network traffic captures has shown to be more accurate, but slower and requiring considerable additional memory resources, due to the substantial costs in feature preprocessing. In this paper, we explore this trade-off and develop the Adaptive Constraint-Driven Classification (AC-DC) framework to efficiently curate a pool of classifiers with different target requirements, aiming to provide comparable classification performance to complex packet-capture classifiers while adapting to varying network traffic load. AC-DC uses an adaptive scheduler that tracks current system memory availability and incoming traffic rates to determine the optimal classifier and batch size to maximize classification performance given memory and processing constraints. Our evaluation shows that AC-DC improves classification performance by more than 100% compared to classifiers that rely on flow statistics alone; compared to the state-of-the-art packet-capture classifiers, AC-DC achieves comparable performance (less than 12.3% lower in F1-Score), but processes traffic over 150x faster.
Forward citations
Cited by 2 Pith papers
-
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 fl...
-
Cruise Control: Dynamic Model Selection for ML-Based Network Traffic Analysis
A DPDK-based system dynamically swaps ML models and feature sets for network traffic analysis, using NIC packet-loss counters as a lightweight overload signal, and reports lower loss and comparable or higher median ac...
Discussion (0). Continue with ORCID to comment.