PeakSketch:Unbiased and Generalized Sketch for Detecting top-k Flows in Network Streams
By studying existing sketch structures,this paper proposes a new sketch structure called PeakSketch,which is applied to three tasks:detecting top-k frequent flows,detecting top-k heavy change flows,and detecting top-k persistent flows.Theoreti-cally,it is proven that PeakSketch can provide unbiased estimates,and the algorithm's er-ror is analyzed.Experimental results demonstrate that PeakSketch excels in various per-formance metrics.In the task of detecting top-k frequent flows,PeakSketch's throughput is significantly enhanced,especially when the allocated memory is less than 200 kB,with throughput improvements of up to 50% and precision improvements of up to double.Peak-Sketch showcases outstanding performance.
国家科技期刊平台
NSTL
万方数据
