Proposed Bloom Filter Research Articles

A New Bloom Filter Architecture for FIB Lookup in Named Data Networking

Network traffic has increased rapidly in recent years, mainly associated with the massive growth of various applications on mobile devices. Named data networking (NDN) technology has been proposed as a future Internet architecture for effectively handling this ever-increasing network traffic. In order to realize the NDN, high-speed lookup algorithms for a forwarding information base (FIB) are crucial. This paper proposes a level-priority trie (LPT) and a 2-phase Bloom filter architecture implementing the LPT. The proposed Bloom filters are sufficiently small to be implemented with on-chip memories (less than 3 MB) for FIB tables with up to 100,000 name prefixes. Hence, the proposed structure enables high-speed FIB lookup. The performance evaluation result shows that FIB lookups for more than 99.99% of inputs are achieved without needing to access the database stored in an off-chip memory.

Efficient Bloom filter for network protocols using AES instruction set

The Internet continues to flourish, while an increasing number of network applications are found deploying Bloom filters. However, the heterogeneity of the Bloom filter realisations complicates the utilisation of relevant applications. Moreover, when applying Bloom filter to traffic that usually has a gigabit capacity, even insignificant delays will accumulate and restrict the effectiveness of the real-time protocols. In this study, the authors present a Bloom filter construction that can be easily and consistently adopted at network nodes, with also considerable processing speed. Specifically, the authors show that AES-based hashes are adequate to create Bloom filters correctly. Then they illustrate how AES new instructions (AES-NI) can be leveraged to accelerate the Bloom filter realisation. According to the authors' experimental results, the proposed Bloom filter enables the best speed performance compared to the competing approaches.

Design and Implementation of a Hierarchical ID/Locator Mapping System

Background/Objectives: The Identifier (ID) and Locator(Loc) split is a key concept in the current Internet environment and the future Internet environment. The binding of ID to Loc is necessary to route/ forward packets, which is called as ID/Loc mapping system. Methods/Statistical analysis: We propose a novel ID/Locator Mapping System (ILMS) mechanism using the bloom filters (BFs) to store information about the identifier. The proposed bloom filters stores the information about the identifiers belonging to the domain managed by the ILMS. Findings: The critical challenge in building the mapping system is scalability simply because the vast number of ID exists in the network and there is no mechanism that can be aggregated as an IP address, since IDs are assumed to be flat. The proposed mapping system is a network of ILMS server in a forest by multiple trees with peering relationship. The main idea is to construct the hierarchical ILMS to manage only a limited number of IDs and so can extract a bit that can be tested for given ID in each ILMS. Improvements/Applications: Scalability issue was addressed by compressing the BFs to indicate the IDs of the child ILMS server.

A partitioning framework for Cassandra NoSQL database using Rendezvous hashing

Due to the gradual expansion in data volume used in social networks and cloud computing, the term "Big data" has appeared with its challenges to store the immense datasets. Many tools and algorithms appeared to handle the challenges of storing big data. NoSQL databases, such as Cassandra and MongoDB, are designed with a novel data management system that can handle and process huge volumes of data. Partitioning data in NoSQL databases is considered one of the critical challenges in database design. In this paper, a MapReduce Rendezvous Hashing-Based Virtual Hierarchies (MR-RHVH) framework is proposed for scalable partitioning of Cassandra NoSQL database. The MapReduce framework is used to implement MR-RHVH on Cassandra to enhance its performance in highly distributed environments. MR-RHVH distributes the nodes to rendezvous regions based on a proposed Adopted Virtual Hierarchies strategy. Each region is responsible for a set of nodes. In addition, a proposed bloom filter evaluator is used to ensure the accurate allocation of keys to nodes in each region. Moreover, a number of experiments were performed to evaluate the performance of MR-RHVH framework, using YCSB for database benchmarking. The results show high scalability rate and less time consuming for MR-RHVH framework over different recent systems.

벡터 블룸 필터를 사용한 IP 주소 검색 알고리즘

A Bloom filter is a space-efficient data structure popularly applied in many network algorithms. This paper proposes a vectored Bloom filter to provide a high-speed Internet protocol (IP) address lookup. While each hash index for a Bloom filter indicates one bit, which is used to identify the membership of the input, each index of the proposed vectored Bloom filter indicates a vector which is used to represent the membership and the output port for the input. Hence the proposed Bloom filter can complete the IP address lookup without accessing an off-chip hash table for most cases. Simulation results show that with a reasonable sized Bloom filter that can be stored using an on-chip memory, an IP address lookup can be performed with less than 0.0003 off-chip accesses on average in our proposed architecture.

Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding

Large-scale information dissemination in multicast communications has been increasingly attracting attention, be it through uptake in new services or through recent research efforts. In these, the core issues are supporting increased forwarding speed, avoiding state in the forwarding elements, and scaling in terms of the multicast tree size. This paper addresses all these challenges-which are crucial for any scalable multicast scheme to be successful-by revisiting the idea of in-packet Bloom filters and source routing. As opposed to the traditional in-packet Bloom filter concept, we build our Bloom filter by enclosing limited information about the structure of the tree. Analytical investigation is conducted and approximation formulas are provided for optimal-length Bloom filters, in which we got rid of typical Bloom filter illnesses such as false-positive forwarding. These filters can be used in several multicast implementations, which are demonstrated through a prototype. Thorough simulations are conducted to demonstrate the scalability of the proposed Bloom filters compared to its counterparts.