A Method to Protect Bloom Filters from Soft Errors

被引:0
|
作者
Reviriego, Pedro [1 ]
Pontarelli, Salvatore [2 ]
Antonio Maestro, Juan [1 ]
Ottavi, Marco [3 ]
机构
[1] Univ Antonio de Nebrija, C Pirineos 55, E-28040 Madrid, Spain
[2] Consorzio Nazl Interuniv Telecomunicaz, Parma, Italy
[3] Univ Roma Tor Vergata, I-00133 Rome, Italy
关键词
Bloom filters; Error correction; Soft errors;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Bloom filters are used in many computing and networking applications where they provide a simple method to test if an element is present in a set. In some of those systems, reliability is a major concern and therefore the Bloom filters should be protected to ensure that errors do not affect the system behavior. One of the most common type of errors in electronic implementations of Bloom filters are radiation induced soft errors. Soft errors can corrupt the contents of a Bloom filter causing false positives and false negatives. Error Correction Codes (ECCs) can be used to protect the Bloom filter so that for example single bit errors are detected and corrected. However, the use of ECCs impacts the implementation area, power and delay. In this paper, a method to efficiently protect the contents of a Bloom filter is presented. The scheme exploits the different effects at the system level of false positives and false negatives to achieve effective error protection at lower cost than that of a traditional ECC. To illustrate the benefits of the proposed method, a case study is presented where the proposed implementation is compared with the use of a traditional Hamming ECC.
引用
收藏
页码:80 / 84
页数:5
相关论文
共 50 条
  • [21] Sliding Bloom Filters
    Naor, Moni
    Yogev, Eylon
    ALGORITHMS AND COMPUTATION, 2013, 8283 : 513 - 523
  • [22] Smart filters - Protect from Laser Threats
    Donval, Ariela
    Fisher, Tali
    Lipman, Ofir
    Oron, Moshe
    LASER TECHNOLOGY FOR DEFENSE AND SECURITY X, 2014, 9081
  • [23] Using register lifetime predictions to protect register files against soft errors
    Montesinos, Pablo
    Liu, Wei
    Torrellas, Josep
    37TH ANNUAL IEEE/IFIP INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, 2007, : 286 - +
  • [24] Efficient Name Lookup Method Based on Hybrid Counting Bloom Filters
    Xu K.
    Li Y.
    Xie G.
    Zhang D.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2023, 60 (05): : 1136 - 1150
  • [25] Bloom Filters in Adversarial Environments
    Naor, Moni
    Eylon, Yogev
    ACM TRANSACTIONS ON ALGORITHMS, 2019, 15 (03)
  • [26] On the Privacy of Counting Bloom Filters
    Reviriego, Pedro
    Sanchez-Macian, Alfonso
    Walzer, Stefan
    Merino-Gomez, Elena
    Liu, Shanshan
    Lombardi, Fabrizio
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2023, 20 (02) : 1488 - 1499
  • [27] Bloom Filters in Adversarial Environments
    Naor, Moni
    Yogev, Eylon
    ADVANCES IN CRYPTOLOGY, PT II, 2015, 9216 : 565 - 584
  • [28] A Case for Partitioned Bloom Filters
    Almeida, Paulo Sergio
    IEEE TRANSACTIONS ON COMPUTERS, 2023, 72 (06) : 1681 - 1691
  • [29] Reducing the Number of Bloom Filters
    Gong, Qingge
    Yang, Tong
    Tong, Hongwei
    Shi, Kai
    Li, Jinghui
    Wu, Xianyan
    PROCEEDINGS OF 2014 IEEE INTERNATIONAL CONFERENCE ON PROGRESS IN INFORMATICS AND COMPUTING (PIC), 2014, : 572 - 576
  • [30] Algebraic operations on Bloom filters
    School of Computer and Communication, Hunan University, Changsha 410082, China
    不详
    不详
    不详
    Tien Tzu Hsueh Pao, 2008, 5 (869-874):