Pontus: Finding Waves in Data Streams
Zhengxin Zhang, Qing Li, Guanglin Duan, Dan Zhao, Jingyu Xiao, Guorui Xie, Yong Jiang
Abstract
The bumps and dips in data streams are valuable patterns for data mining and networking scenarios such as online advertising and botnet detection. In this paper, we define the wave, a data stream pattern with a serious deviation from the stable arrival rate for a period of time. We then propose Pontus, an efficient framework for wave detection and estimation. In Pontus, a lightweight data structure is utilized for the preliminary processing of incoming packets in the data plane to take advantage of its high processing speed; then, the powerful control plane carries out computationally intensive wave detection and estimation. In particular, we propose the Multi-Stage Progressive Tracking strategy which detects waves in stages and removes any disqualified items promptly to save memory. Hash collisions are addressed by a Stage Variance Maximization technique to reduce estimation error. Moreover, we prove the theoretical error bound and establish upper bounds of false positive and false negative. Experiment results show that the software version of Pontus can achieve around 97% F1-Score even under scarce memory when baselines fail. Furthermore, the implemented prototype of Pontus based on P4 achieves 842 × higher throughput than the baseline strawman solution.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 433e4df9-cf9a-4334-a8d0-b43cd81c01d7Cited by top-tier papers1
Ask how each one uses itBuilds on6
- Understanding the Mirai BotnetManos Antonakakis, Tim April, Michael D. Bailey, Matt Bernhard et al.USENIX Security 2017 · 2,003 citations
- CocoSketch: high-performance sketch-based measurement over arbitrary partial key queryYinda Zhang, Zaoxing Liu, Ruixin Wang, Tong Yang et al.SIGCOMM 2021 · 146 citations
- On-Off Sketch: A Fast and Accurate Sketch on PersistenceYinda Zhang, Jinyang Li, Yutian Lei, Tong Yang et al.VLDB 2021 · 63 citations
- BurstSketch: Finding Bursts in Data StreamsZheng Zhong, Shen Yan, Zikun Li, Decheng Tan et al.SIGMOD 2021 · 58 citations
- Out of Many We are One: Measuring Item Batch with Clock-SketchPeiqing Chen, Dong Chen, Lingxiao Zheng, Jizhou Li et al.SIGMOD 2021 · 35 citations
Related papers
- Pontus: A Memory-Efficient and High-Accuracy Approach for Persistence-Based Item Lookup in High-Velocity Data StreamsWeihe Li, Zukai Li, Beyza Bütün, Alec F. Diallo et al.WWW 2025 · 4 citations
- Scout Sketch: Finding Promising Items in Data StreamsTianyu Ma, Guoju Gao, He Huang, Yu-e Sun et al.INFOCOM 2024 · 4 citations
- BurstDetector: Real-Time and Accurate Across-Period Burst Detection in High-Speed NetworksZhongyi Cheng, Guoju Gao, He Huang, Yu-e Sun et al.INFOCOM 2024 · 8 citations
- HorusEye: A Realtime IoT Malicious Traffic Detection Framework using Programmable SwitchesYutao Dong, Qing Li, Kaidong Wu, Ruoyu Li et al.USENIX Security 2023
- PBSketch: Finding Periodic Burst Items in Data StreamsZhuochen Fan, Zhongxian Liang, Zirui Liu, Dayu Wang et al.KDD 2026
