Theory and Practice of Bloom Filters for Distributed Systems

Abstract

Abstract-Many network solutions and overlay networks utilize probabilistic techniques to reduce information processing and networking costs. This survey article presents a number of frequently used and useful probabilistic techniques. Bloom filters and their variants are of prime importance, and they are heavily used in various distributed systems. This has been reflected in recent research and many new algorithms have been proposed for distributed systems that are either directly or indirectly based on Bloom filters. In this survey, we give an overview of the basic and advanced techniques, reviewing over 20 variants and discussing their application in distributed systems, in particular for caching, peer-to-peer systems, routing and forwarding, and measurement data summarization.

Design and Implementation of Dynamic and Efficient Web Crawler for XSS Vulnerability Detection

“…It is based on hash to detect whether an element exists in a particular set. It is a space-and time-efficient data structure [8].…”

“…In the case that hash functions are properly selected, it is obvious that the array size i and the number of hash functions j determine the probability of False Positive. According to the literature [8], we have the exact probability of False Positives below:…”

Optimized event notification in CAN through in-frame replies and Bloom filters

“…A number of techniques are proposed for dealing with event notification in such a kind of systems, by using both existing solutions (classical CAN and CAN FD) and new technologies, like the CAN with eXtensible in-frame Reply (CAN XR) proposal [9]. The adoption of Bloom filters [10], [11]-a data structure conceived for efficiently managing huge data sets-has also been considered for those scenarios where false positives are tolerated. Simple metrics have been employed to assess, in very general terms, the performance these solutions offer.…”

An Examination of the Bloom Filter and its Application in Preventing Weak Password Choices

“…But it has always been a concern that how we can select a proper and strong password that cannot be predicted or cracked easily. Lots of approaches and techniques have been proposed in this area that try to generate a complicated combination of characters and numbers as password [14,15]. In the most cases it works but it is not always comfortable for the user to have or memorize a system generated password, instead if we could have a dictionary of weak passwords which are easy to recognize by attackers and check them against the entered password proposed by user we can easily decide the selected password by end user is strong enough or not.…”