Stair Sketch: Towards Clearer Memory of Recent Events for Network Security Audits

View at publisher Summarise with VIRAT
Authors: Ce Zheng, Wei Zhou, Yikai Zhao, Tong Yang, Zhenyu Guan, Bin Cui
Cited by: 0
References: 57

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

In large-scale and complex network environments, frequent security events make security audits increasingly important. Effective audits rely on maintaining a clearer memory of recent security events to support reliable identification and analysis. However, in high-volume data streams, existing methods struggle to ensure more accurate recording of recent time periods under a fixed memory budget while keeping the overall error controllable. To address this, we propose a novel data stream processing structure, the Stair Sketch. The key idea is to organize limited memory into a staircase of atomic sketches, where newer time periods hold more sketches. When memory is exhausted, one sketch is reclaimed from each existing period for the new one, efficiently allocating more memory to recent periods without updating all sketches. To record longer time periods and handle load imbalance, we introduce vertical sampling and horizontal sharing techniques to optimize our method. We theoretically derive the error bounds of Stair Sketch. Extensive experiments show that Stair Sketch improves accuracy by at least one order of magnitude compared with state-of-the-art methods, while reducing memory accesses by up to 50%. All related codes are open-sourced at GitHub.

Fields of Study & Subjects

Advanced Database Systems and Queries Network Security and Intrusion Detection Network Packet Processing and Optimization

Publication details

Journal / source
IEEE Transactions on Dependable and Secure Computing
Volume
23
Issue
4
Pages
7926–7944
Publication date
30 March 2026
Language
EN