LUSketch: A Fast and Precise Sketch for top-k Finding in Data Streams

Lu, Jie; Chen, Hongchang; Zhang, Zhen

doi:10.1109/icccn54977.2022.9868882

Cited by 1 publication

(2 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sketch-based methodologies, such as Count Min [13], LUSketch [28], sketch-BF [29], Cuckoo Counter [37], CountMax [38], FCM-Sketch [39], ActiveGuardian [36] and others [40,41], have been extensively researched.…”

Section: Methods Based On Sketchmentioning

confidence: 99%

See 1 more Smart Citation

Detecting Top-k Flows Combining Probabilistic Sketch and Sliding Window

Zheng,

Chen,

Feng

et al. 2024

IEEE Access

View full text Add to dashboard Cite

Efficient real-time top-k flows measurement plays a pivotal role in enhancing both network performance and security, including tasks such as timely traffic scheduling, optimizing network latency and identifying potential security threats. However, traditional methods for detecting top-k flows suffer from decreased accuracy and high memory overhead. Furthermore, many existing methods overlook finer-grained measurements, such as the detection within the latest short time intervals. With the increasing expansion scale and link speed of the network, an accurate real-time top-k flows identified method is required. This paper proposes wSketch, a novel sketch-based method for real-time top-k flows detection. The innovations of wSketch are that it combines with the sliding window model and circular queue model, and introduces a novel probabilistic update solution. The probabilistic update mechanism gives the larger flow a greater chance of retention, the sliding window model focuses on the latest flow in the last W time units, and the circular queue reduces memory consumption. Therefore, wSketch provides insights into the current network situation and does well in anticipating future trends. The experimental results showcase wSketch's superior performance, achieving over 96% accuracy with a small memory size of 20KB.

show abstract

Section: Methods Based On Sketchmentioning

confidence: 99%

“…(3) Methods based on sketch: These methods [13,28,29,30] achieve approximated top-k flows measurement with high accuracy by counting flows within a compact data structure (i.e., sketch) shared among different flows. For example, Count Min Sketch [13] utilizes a twodimensional array with d rows and s columns.…”

Section: Introductionmentioning

confidence: 99%