JitterSketch: Finding Jittery Flows in Network Streams

Read full text
Authors: Zhongxian Liang, Qilong Shi, Xiyan Liang, Z. H. Li, Wenjun Li, Tong Yang, Yangyang Wang, Mingwei Xu, Weizhe Zhang
Cited by: 2
References: 31

Abstract

In the modern internet, with the proliferation of real-time applications such as online gaming and video conferencing, the timely detection of network jitter has become a critical task in network measurement. Network jitter is defined as the abrupt fluctuations in packet inter-arrival times within network flows, which severely degrade the Quality of Service for these applications. Traditional jitter detection methods primarily focus on macro-level end-to-end or hop-by-hop latency variations, neglecting the fine-grained jitter that occurs within specific flows. In this paper, we present JitterSketch, the first sketch-based algorithm specifically designed for detecting jittery flows. JitterSketch employs a novel three-stage structure to efficiently filter out infrequent and stable flows, thereby identifying and reporting the jittery flows that have the most significant impact on network quality. Extensive experiments demonstrate that JitterSketch achieves an improvement of up to 50 percentage points in both recall and precision rates compared to baseline solutions, while maintaining high processing throughput. Furthermore, we deployed JitterSketch in a QoS simulation system, where it yielded significant improvements in QoS.

Fields of Study & Subjects

Network Traffic and Congestion Control Peer-to-Peer Network Technologies Caching and Content Delivery

Publication details

Journal / source
Proceedings of the ACM Web Conference 2026
Publisher
ACM
Pages
7144–7155
Publication date
9 April 2026