Results 21 to 30 of about 13,604 (287)
Increasing the power efficiency of Bloom filters for network string matching [PDF]
, 2006 Although software based techniques are widely accepted in computer security systems, there is a growing interest to utilize hardware opportunities in order to compensate for the network bandwidth increases.
Kocak, Taskin +3 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 +2 more sources
Content-Based Approach for Improving Bloom Filter Efficiency
Applied Sciences, 2023 Bloom filters are a type of data structure that is used to test whether or not an element is a member of a set. They are known for being space-efficient and are commonly employed in various applications, such as network routers, web browsers, and ...
Mohammed Alsuhaibani +3 more
doaj +1 more source
Redundant RFID Data Removing Algorithm Based on Dynamic-additional Bloom Filter [PDF]
Jisuanji kexue, 2021 The high redundancy generated by RFID devices in reading tag information will result in pressure of real-time transmission,waste of storage space and unreliable analysis results of upper application.To slove these problems,a dynamic-additional Bloom ...
DUAN Wen, ZHOU Liang
doaj +1 more source
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 +1 more source
Counting With Tinytable: Every Bit Counts!
IEEE Access, 2019 Bloom filters are space efficient data structures that support approximate membership queries. They are easily extensible but incur significant overheads when extended to support additional functionality, such as removals or counting.
Gil Einziger, Roy Friedman
doaj +1 more source
Efficient Bloom Filter-Based Routing Protocol for Scalable Mobile Networks
Engineering Proceedings, 2023 Non-geographic routing protocols are inefficient when applied to large-scale mobile networks composed of hundreds of nodes. On the other hand, geographic routing protocols have the disadvantage of needing a location sensor.
Prabu S. +4 more
doaj +1 more source
Cryptanalysis of Basic Bloom Filters Used for Privacy Preserving Record Linkage
The Journal of Privacy and Confidentiality, 2014 Bloom filter encoded identifiers are increasingly used for privacy preserving record linkage applications, because they allow for errors in encrypted identifiers. However, little research on the security of Bloom filters has been published so far.
Frank Niedermeyer +3 more
doaj +1 more source
Dynamically Allocated Bloom Filter-Based PIT Architectures
IEEE Access, 2022 As a key component in implementing Named Data Networking (NDN), Pending Interest Table (PIT) requires an efficient exact-matching algorithm for a scalable and fast PIT lookup.
Saeyoung Jang, Hayoung Byun, Hyesook Lim
doaj +1 more source
Bloom filters: One size fits all [PDF]
, 2007 —Bloom filters impress by their sheer elegance and have become a widely and indiscriminately used tool in network applications, although, as we show, their performance can often be far from optimal.
Marcel Waldvogel +3 more
core +1 more source