An Efficient Per-Flow Size Measurement Framework Based on Dynamic Fuzzy Clustering Learning

Per-flow size measurement aims to count the number of packets or the total bytes associated with each flow, serving as a critical foundation for network management, anomaly detection, load balancing, and other essential network functions. However, due to the limited switch’s on-chip cache memory, most existing per-flow size measurement methods adopt counter sharing, which intermixes information from multiple flows. This introduces considerable noise and severely impacts the measurement accuracy, particularly for small to medium-sized flows. To address this challenge, this paper proposes a novel flow size measurement algorithm based on dynamic fuzzy clustering learning. The algorithm compresses and stores flow size information in on-chip memory, while selectively sampling a subset of traffic data for off-chip dynamic fuzzification processing. By applying dynamic fuzzy relational clustering, the sampled traffic data are grouped into multiple clusters, which are then used to train distinct models tailored to different flow categories. This approach significantly enhances the measurement accuracy for small and medium-sized flows. Experiments based on real traffic traces demonstrate that, under a constrained memory footprint of only 100KB, the proposed method reduces the average relative error by 70.92% compared to conventional techniques.

Authors

Institutions

Publication Details

Published
2025-04-18
DOI
https://doi.org/10.1109/scecs65243.2025.11065165
Primary Topic
Industrial Vision Systems and Defect Detection
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Efficient Per-Flow Size Measurement Framework Based on Dynamic Fuzzy Clustering Learning

Dan Hu, Pengcheng Zhang, Jun Biao Lu, Liang Tong et al.
Industrial Vision Systems and Defect Detection
article

An Efficient Per-Flow Size Measurement Framework Based on Dynamic Fuzzy Clustering Learning

Dan Hu, Pengcheng Zhang, Jun Biao Lu, Liang Tong, Dai Wang, Tao Su, Hao Yu
article en

Abstract

Per-flow size measurement aims to count the number of packets or the total bytes associated with each flow, serving as a critical foundation for network management, anomaly detection, load balancing, and other essential network functions. However, due to the limited switch’s on-chip cache memory, most existing per-flow size measurement methods adopt counter sharing, which intermixes information from multiple flows. This introduces considerable noise and severely impacts the measurement accuracy, particularly for small to medium-sized flows. To address this challenge, this paper proposes a novel flow size measurement algorithm based on dynamic fuzzy clustering learning. The algorithm compresses and stores flow size information in on-chip memory, while selectively sampling a subset of traffic data for off-chip dynamic fuzzification processing. By applying dynamic fuzzy relational clustering, the sampled traffic data are grouped into multiple clusters, which are then used to train distinct models tailored to different flow categories. This approach significantly enhances the measurement accuracy for small and medium-sized flows. Experiments based on real traffic traces demonstrate that, under a constrained memory footprint of only 100KB, the proposed method reduces the average relative error by 70.92% compared to conventional techniques.

State Grid Corporation of China (China) (CN), Anhui Transport Consulting & Design Institute (China) (CN)
Science and Technology Project of State Grid
Openalex Percentile: Top 76%
Industrial Vision Systems and Defect Detection
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.