Adaptive One Memory Access Bloom Filters
| Autor: | Pedro Reviriego, Alfonso Sanchez-Macian, Ori Rottenstreich, David Larrabeiti |
|---|---|
| Přispěvatelé: | Comunidad de Madrid, Agencia Estatal de Investigación (España) |
| Rok vydání: | 2022 |
| Předmět: | |
| Zdroj: | e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid instname |
| ISSN: | 2373-7379 |
| DOI: | 10.1109/tnsm.2022.3145436 |
| Popis: | Bloom filters are widely used to perform fast approximate membership checking in networking applications. The main limitation of Bloom filters is that they suffer from false positives that can only be reduced by using more memory. We suggest to take advantage of a common repetition in the identity of queried elements to adapt Bloom filters for avoiding false positives for elements that repeat upon queries. In this paper, one memory access Bloom filters are used to design an adaptation scheme that can effectively remove false positives while completing all queries in a single memory access. The proposed filters are well suited for scenarios on which the number of memory bits per element is low and thus complement existing adaptive cuckoo filters that are not efficient in that case. The evaluation results using packet traces show that the proposed adaptive Bloom filters can significantly reduce the false positive rate in networking applications with the single memory access. In particular, when using as few as four bits per element, false positive rates below 5% are achieved. This work was supported by the ACHILLES project PID2019-104207RB-I00 and the Go2Edge network RED2018-102585-T funded by the Spanish Agencia Estatal de Investigación (AEI) 10.13039/501100011033 and by the Madrid Community research project TAPIR-CM grant no. P2018/TCS-4496. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|