.png){kind=icon}
返回
Longest-First Search Using Bloom Filter: Algorithm and FPGA Implementation
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2025.3551748.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Due to the surge in Internet traffic and the rapid increase in forwarding table entries, achieving wire-speed packet forwarding in Internet routers demands both algorithmic enhancements and hardware innovations. In this paper, we propose the longest-first search algorithm with a Bloom filter that stores prefixes in a leaf-pushing trie. Our approach utilizes an on-chip Bloom filter to indicate the presence of prefixes within the trie, while an off-chip hash table stores the corresponding output port information for each prefix. For each incoming IP address, the Bloom filter query begins from the longest length, reducing the queried number of bits by one for each negative result. The off-chip hash table is only accessed when the query to the Bloom filter produces a positive result. Therefore, access to the slower off-chip memory is minimized to once, given a reasonable Bloom filter size. The proposed approach is simulated using C++ and constructed with Verilog for field programmable gate array (FPGA) implementation. The experimental results indicate that the proposed approach achieves the throughput of 0.8 million packets per second at a clock frequency of 100MHz.
Keyword:
Filtering algorithms
IP networks
Information filters
Filtering theory
Field programmable gate arrays
Matched filters
Lenses
Internet
System-on-chip
Hash functions
Binary trie
Bloom filter
FPGA
IP address lookup
leaf-pushing
Verilog HDL
