ipBF: A Fast and Accurate IP Address Lookup Using 3D Bloom Filter

2019 ◽  
pp. 182-191 ◽  
Author(s):  
Ripon Patgiri ◽  
Samir Kumar Borgohain ◽  
Sabuzima Nayak
Keyword(s):  
Bloom Filter ◽  
Ip Address ◽  
Ip Address Lookup

scholarly journals Vectored-Bloom Filter for IP Address Lookup: Algorithm and Hardware Architectures

2019 ◽  
Vol 9 (21) ◽  
pp. 4621 ◽  
Author(s):  
Hayoung Byun ◽  
Qingling Li ◽  
Hyesook Lim
Keyword(s):  
High Speed ◽  
High Performance ◽  
Hash Table ◽  
Bloom Filter ◽  
Ip Address ◽  
Behavior Simulation ◽  
Field Programmable ◽  
Ip Address Lookup ◽  
Flexible Architecture ◽  
Timing Simulation

The Internet Protocol (IP) address lookup is one of the most challenging tasks for Internet routers, since it requires to perform packet forwarding at wire-speed for tens of millions of incomming packets per second. Efficient IP address lookup algorithms have been widely studied to satisfy this requirement. Among them, Bloom filter-based approach is attractive in providing high performance. This paper proposes a high-speed and flexible architecture based on a vectored-Bloom filter (VBF), which is a space-efficient data structure that can be stored in a fast on-chip memory. An off-chip hash table is infrequently accessed, only when the VBF fails to provide address lookup results. The proposed architecture has been evaluated through both a behavior simulation with C language and a timing simulation with Verilog. The hardware implementation result shows that the proposed architecture can achieve the throughput of 5 million packets per second in a field programmable gate array (FPGA) operated at 100 MHz.

scholarly journals A Novel Prefix Cache with Two-Level Bloom Filters in IP Address Lookup

2020 ◽  
Vol 10 (20) ◽  
pp. 7198
Author(s):  
Junghwan Kim ◽  
Myeong-Cheol Ko ◽  
Moon Sun Shin ◽  
Jinsoo Kim
Keyword(s):  
False Positive ◽  
Bloom Filter ◽  
Bloom Filters ◽  
Experimental Result ◽  
Ip Address ◽  
Positive Ratio ◽  
Ip Addresses ◽  
False Positive Ratio ◽  
Ip Address Lookup ◽  
Filter Size

Prefix caching is one of the notable techniques in enhancing the IP address lookup performance which is crucial in packet forwarding. A cached prefix can match a range of IP addresses, so prefix caching leads to a higher cache hit ratio than IP address caching. However, prefix caching has an issue to be resolved. When a prefix is matched in a cache, the prefix cannot be the result without assuring that there is no longer descendant prefix of the matching prefix which is not cached yet. This is due to the aspect of the IP address lookup seeking to find the longest matching prefix. Some prefix expansion techniques avoid the problem, but the expanded prefixes occupy more entries as well as cover a smaller range of IP addresses. This paper proposes a novel prefix caching scheme in which the original prefix can be cached without expansion. In this scheme, for each prefix, a Bloom filter is constructed to be used for testing if there is any matchable descendant. The false positive ratio of a Bloom filter generally grows as the number of elements contained in the filter increases. We devise an elaborate two-level Bloom filter scheme which adjusts the filter size at each level, to reduce the false positive ratio, according to the number of contained elements. The experimental result shows that the proposed scheme achieves a very low cache miss ratio without increasing the number of prefixes. In addition, most of the filter assertions are negative, which means the proposed prefix cache effectively hits the matching prefix using the filter.

Efficient IP address lookup with a counting Bloom filter in Trie-based algorithms

2016 ◽  
Author(s):  
Shu-he Wang ◽  
Bi-hua Tang ◽  
Dong-ming Yuan ◽  
He-fei Hu ◽  
Jing Ran
Keyword(s):  
Bloom Filter ◽  
Ip Address ◽  
Ip Address Lookup ◽  
Counting Bloom Filter
Sign in / Sign up

Export Citation Format

Share Document