Pith. sign in

REVIEW 2 cited by

ServeFlow: A Fast-Slow Model Architecture for Network Traffic Analysis

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

arxiv 2402.03694 v2 pith:C2MPQQBS submitted 2024-02-06 cs.NI cs.AI

classification cs.NIcs.AI
keywords flowsmodelnetworktrafficanalysishighinferencemodels
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Network traffic analysis increasingly uses complex machine learning models as the internet consolidates and traffic gets more encrypted. However, over high-bandwidth networks, flows can easily arrive faster than model inference rates. The temporal nature of network flows limits simple scale-out approaches leveraged in other high-traffic machine learning applications. Accordingly, this paper presents ServeFlow, a solution for machine-learning model serving aimed at network traffic analysis tasks, which carefully selects the number of packets to collect and the models to apply for individual flows to achieve a balance between minimal latency, high service rate, and high accuracy. We identify that on the same task, inference time across models can differ by 1.8x - 141.3x, while the inter-packet waiting time is up to 6-8 orders of magnitude higher than the inference time! Based on these insights, we tailor a novel fast-slow model architecture for networking ML pipelines. Flows are assigned to a slower model only when the inferences from the fast model are deemed high uncertainty. ServeFlow is able to make inferences on 76.3% of flows in under 16ms, which is a speed-up of 40.5x on the median end-to-end serving latency while increasing the service rate and maintaining similar accuracy. Even with thousands of features per flow, it achieves a service rate of over 48.5k new flows per second on a 16-core CPU commodity server, which matches the order of magnitude of flow rates observed on city-level network backbones.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate

    cs.NI 2025-08 conditional novelty 7.0 of 10

    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...

  2. Cruise Control: Dynamic Model Selection for ML-Based Network Traffic Analysis

    cs.NI 2024-12 conditional novelty 6.0 of 10

    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...

Pith tools