Efficient dynamic packet filtering program based on shared-node counting Bloom filter

被引：0
|
作者：
Wang, Jie [1 ]
Shi, Cheng-Hui [1 ]
Liu, Ya-Bin [1 ]
机构：
[1] School of Electrical Engineering, Zhengzhou Univ., Zhengzhou 450001, China
来源：
Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics | 2009年 / 31卷 / 09期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：2227 / 2231
相关论文
共 50 条
  • [1] A Study on d-left Counting Bloom Filter for Dynamic Packets Filtering
    Lin, Peizhen
    Deng, Hui
    Wang, Feng
    Tan, Weiliang
    INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, 2011, 14 (04): : 1353 - 1361
  • [2] A Dynamic Structure of Counting Bloom Filter
    Gu, Jianhua
    Zhou, Xingshe
    PROCEEDINGS OF THE 2011 2ND INTERNATIONAL CONGRESS ON COMPUTER APPLICATIONS AND COMPUTATIONAL SCIENCE, VOL 2, 2012, 145 : 31 - 37
  • [3] An efficient provable data possession scheme based on counting bloom filter for dynamic data in the cloud storage
    Jung E.
    Jeong J.
    2016, Science and Engineering Research Support Society (11): : 9 - 16
  • [4] An Efficient Packet Classification Method Based on Extended Bloom Filter and Cuckoo Hash
    Siyu Wang
    Fengsong Liu
    Zhihua Zhu
    Hengqi Liu
    2022 11TH INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS (ICCCAS 2022), 2022, : 273 - 277
  • [5] Reducing false rate packet recognition using Dual Counting Bloom Filter
    Dodig, Ivica
    Sruk, Vlado
    Cafuta, Davor
    TELECOMMUNICATION SYSTEMS, 2018, 68 (01) : 67 - 78
  • [6] Reducing false rate packet recognition using Dual Counting Bloom Filter
    Ivica Dodig
    Vlado Sruk
    Davor Cafuta
    Telecommunication Systems, 2018, 68 : 67 - 78
  • [7] Modified collision packet classification using counting Bloom filter in tuple space
    Ahmadi, Mahmood
    Wong, Stephan
    PROCEEDINGS OF THE IASTED INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING AND NETWORKS, 2007, : 315 - +
  • [8] Seesaw Counting Filter: An Efficient Guardian for Vulnerable Negative Keys During Dynamic Filtering
    Li, Meng
    Chen, Deyi
    Dai, Haipeng
    Xie, Rongbiao
    Luo, Siqiang
    Gu, Rong
    Yang, Tong
    Chen, Guihai
    PROCEEDINGS OF THE ACM WEB CONFERENCE 2022 (WWW'22), 2022, : 2759 - 2767
  • [9] Efficient IP address lookup with a counting Bloom filter in Trie-based algorithms
    Wang, Shu-he
    Tang, Bi-hua
    Yuan, Dong-ming
    Hu, He-fei
    Ran, Jing
    WIRELESS COMMUNICATION AND SENSOR NETWORK, 2016, : 743 - 750
  • [10] An Efficient Service Discovery Algorithm for Counting Bloom Filter-Based Service Registry
    Cheng, Shuxing
    Chang, Carl K.
    Zhang, Liang-Jie
    2009 IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES, VOLS 1 AND 2, 2009, : 157 - +
12345