<i>FastFlow</i> : Early Yet Robust Network Flow Classification using the Minimal Number of Time-Series Packets

Internet service providers (ISPs) that operate high-speed links expect network flow classifiers to accurately classify flows as early as possible, be robust to packet sequence disorders, and be capable of detecting the existence of unseen flow types. We develop FastFlow , a time-series flow classification method that achieves the above objectives, which dynamically selects the minimal number of packets at runtime to balance accuracy and efficiency. Our method first represents the packet streams of a flow at both per-packet and per-slot granularity for precise packet statistics with robustness to packet sequence disorders. A sequential decision-based classification model that leverages the LSTM architecture is developed. The model makes dynamic decisions on the minimal number of time-series data points to classify each flow. We evaluated our method on three public datasets and demonstrated its superior performance in early and accurate flow classification. Deployment insights on the classification of over 22.9 million flows across seven application types and 33 content providers in a campus network over one week are discussed.

Authors

Institutions

Publication Details

Journal
ACM SIGMETRICS Performance Evaluation Review
Published
2025-06-16
DOI
https://doi.org/10.1145/3744970.3727286
Primary Topic
Internet Traffic Analysis and Secure E-voting
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

FastFlow : Early Yet Robust Network Flow Classification using the Minimal Number of Time-Series Packets

Gustavo Batista, Rushi Jayeshkumar Babaria, Minzhao Lyu, Vijay Sivaraman
ACM SIGMETRICS Performance Evaluation Review
Internet Traffic Analysis and Secure E-voting
article

FastFlow : Early Yet Robust Network Flow Classification using the Minimal Number of Time-Series Packets

Gustavo Batista, Rushi Jayeshkumar Babaria, Minzhao Lyu, Vijay Sivaraman
article en

Abstract

Internet service providers (ISPs) that operate high-speed links expect network flow classifiers to accurately classify flows as early as possible, be robust to packet sequence disorders, and be capable of detecting the existence of unseen flow types. We develop FastFlow , a time-series flow classification method that achieves the above objectives, which dynamically selects the minimal number of packets at runtime to balance accuracy and efficiency. Our method first represents the packet streams of a flow at both per-packet and per-slot granularity for precise packet statistics with robustness to packet sequence disorders. A sequential decision-based classification model that leverages the LSTM architecture is developed. The model makes dynamic decisions on the minimal number of time-series data points to classify each flow. We evaluated our method on three public datasets and demonstrated its superior performance in early and accurate flow classification. Deployment insights on the classification of over 22.9 million flows across seven application types and 33 content providers in a campus network over one week are discussed.

ACM SIGMETRICS Performance Evaluation ReviewVol. 53(1)
UNSW Sydney (AU)
Peace, Justice and strong institutions
Openalex Percentile: Top 93%
Internet Traffic Analysis and Secure E-voting
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.