On-demand Time-decaying Bloom Filters for Telemarketer Detection

被引:15
|
作者
Bianchi, Giuseppe [1 ]
d'Heureuse, Nico [1 ]
Niccolini, Saverio [1 ]
机构
[1] Univ Roma Tor Vergata, CNIT, I-00173 Rome, Italy
关键词
Algorithms; Design; Performance; Measurement; Rate metering; Bloom filters; monitoring; VoIP; spam; telemarketing detection;
D O I
10.1145/2043165.2043167
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Several traffic monitoring applications may benefit from the availability of efficient mechanisms for approximately tracking smoothed time averages rather than raw counts. This paper provides two contributions in this direction. First, our analysis of Time-decaying Bloom filters, formerly proposed data structures devised to perform approximate Exponentially Weighted Moving Averages on streaming data, reveals two major shortcomings: biased estimation when measurements are read in arbitrary time instants, and slow operation resulting from the need to periodically update all the filter's counters at once. We thus propose a new construction, called On-demand Time-decaying Bloom filter, which relies on a continuous-time operation to overcome the accuracy/performance limitations of the original window-based approach. Second, we show how this new technique can be exploited in the design of high performance stream-based monitoring applications, by developing VoIPSTREAM, a proof-of-concept real-time analysis version of a formerly proposed system for telemarketing call detection. Our validation results, carried out over real telephony data, show how VoIPSTREAM closely mimics the feature extraction process and traffic analysis techniques implemented in the offine system, at a significantly higher processing speed, and without requiring any storage of per-user call detail records.
引用
收藏
页码:5 / 12
页数:8
相关论文
共 50 条
  • [1] Time-decaying bloom filters for data streams with skewed distributions
    Cheng, K
    Xiang, LM
    Iwaihara, M
    Xu, HY
    Mohania, MM
    15th International Workshop on Research Issues in Data Engineering: Stream Data Mining and Applications, Proceedings, 2005, : 63 - 69
  • [2] Time-Decaying Bloom Filters for Efficient Middle-Tier Data Management
    Cheng, Kai
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2010, PT 3, PROCEEDINGS, 2010, 6018 : 395 - 404
  • [3] Inferring Insertion Times and Optimizing Error Penalties in Time-decaying Bloom Filters
    Dautrich, Jonathan L., Jr.
    Ravishankar, Chinya V.
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2019, 44 (02):
  • [4] Dynamically Maintaining Duplicate-Insensitive and Time-Decayed Sum Using Time-Decaying Bloom Filter
    Zhang, Yu
    Shen, Hong
    Tian, Hui
    Zhang, Xianchao
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PROCEEDINGS, 2009, 5574 : 741 - +
  • [5] Maintaining time-decaying stream aggregates
    Cohen, E
    Strauss, MJ
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2006, 59 (01): : 19 - 36
  • [6] Scalable Time-Decaying Adaptive Prediction Algorithm
    Tan, Yinyan
    Fan, Zhe
    Li, Guilin
    Wang, Fangshan
    Li, Zhengbing
    Liu, Shikai
    Pan, Qiuling
    Xing, Eric P.
    Ho, Qirong
    KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, : 617 - 626
  • [7] Bayesian analysis of biexponential time-decaying signals
    Whittenburg, SL
    SPECTROCHIMICA ACTA PART A-MOLECULAR AND BIOMOLECULAR SPECTROSCOPY, 1998, 54 (04) : 559 - 566
  • [8] Bayesian analysis of biexponential time-decaying signals
    Whittenburg, S.L.
    Spectrochimica Acta, Part A: Molecular and Biomolecular Spectroscopy, 1998, 54A (04): : 559 - 566
  • [9] Time-Decaying Sketches for Sensor Data Aggregation
    Cormode, Graham
    Tirthapura, Srikanta
    Xu, Bojian
    PODC'07: PROCEEDINGS OF THE 26TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2007, : 215 - 224
  • [10] QUANTUM INVERSE SCATTERING FOR TIME-DECAYING HARMONIC OSCILLATORS
    Ishida, Atsuhide
    INVERSE PROBLEMS AND IMAGING, 2025, 19 (02) : 282 - 296