Results 21 to 30 of about 696,655 (295)
The Bloom paradox: When not to use a Bloom filter? [PDF]
2012 Proceedings IEEE INFOCOM, 2012 In this paper, we uncover the Bloom paradox in Bloom Filters: Sometimes, the Bloom Filter is harmful and should not be queried. We first analyze conditions under which the Bloom paradox occurs in a Bloom Filter and demonstrate that it depends on the a priori probability that a given element belongs to the represented set. We show that the Bloom paradox
Ori Rottenstreich, Isaac Keslassy
openaire +2 more sources
Energy-efficient pipelined bloom filters for network intrusion detection [PDF]
, 2006 Software-based detection techniques are commonly used to identify the predefined signatures in network streams. However, the software-based techniques can not keep up with the speeds that network bandwidth increases.
Kocak, Taskin +5 more
core +1 more source
Optimasi Pencarian Alamat IP Menggunakan Counting Bloom Filter Pada Web Application Firewall [PDF]
, 2020 Proses pencarian IP pada Web Application Firewall menjadi sebuah tantangan ketika database IP yang dikumpulkan mulai membesar. WAF harus dapat dengan cepat memberikan keputusan apakah sebuah IP masuk kedalam kategori buruk (blacklisted ip) atau tidak ...
Utami, Ema +3 more
core +1 more source
Hunting the Pertinency of Bloom Filter in Computer Networking and Beyond: A Survey
Journal of Computer Networks and Communications, 2019 Bloom filter is a probabilistic data structure to filter a membership of a set. Bloom filter returns “true” or “false” with an error tolerance depending on the presence of the element in the set.
Ripon Patgiri +2 more
doaj +1 more source
Let the Tree Bloom: Scalable Opportunistic Routing with ORPL [PDF]
, 2013 Routing in battery-operated wireless networks is challenging, posing a tradeoff between energy and latency. Previous work has shown that opportunistic routing can achieve low-latency data collection in duty-cycled networks.
Voigt, Thiemo, +8 more
core +1 more source
CoRR, 2019 The Distributed Bloom Filter is a space-efficient, probabilistic data structure designed to perform more efficient set reconciliations in distributed systems. It guarantees eventual consistency of states between nodes in a system, while still keeping bloom filter sizes as compact as possible.
Lum Ramabaja, Arber Avdullahu
openaire +3 more sources
Bloom Filters in Adversarial Environments [PDF]
ACM Transactions on Algorithms, 2015 Many efficient data structures use randomness, allowing them to improve upon deterministic ones. Usually, their efficiency and correctness are analyzed using probabilistic tools under the assumption that the inputs and queries are independent of the internal randomness of the data structure.
Moni Naor, Eylon Yogev
openaire +4 more sources
Adaptive Compression Trie Based Bloom Filter: Request Filter for NDN Content Store
IEEE Access, 2017 In named data networking (NDN), content store (CS) is proposed to provide on-path cache service. When user's request with content name is forwarded to NDN node, exact match in CS is carried out first.
Ran Zhang +4 more
doaj +1 more source
False Negative Problem of Counting Bloom Filter [PDF]
, 2010 Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often believe that it is possible that a Bloom filter returns a false positive, but ...
Guo, Deke +3 more
core +1 more source
Partitioned Learned Bloom Filter
CoRR, 2020 Bloom filters are space-efficient probabilistic data structures that are used to test whether an element is a member of a set, and may return false positives. Recently, variations referred to as learned Bloom filters were developed that can provide improved performance in terms of the rate of false positives, by using a learned model for the ...
Kapil Vaidya +3 more
openaire +4 more sources