.png){kind=icon}
.png){kind=icon}
Return
Improving Bloom Filter Forwarding Architectures
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2014.2355199.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To improve Bloom filter-based packet forwarding architectures, we introduce one additional Bloom filter that stores the correct next hop information for recent false positives so as to handle subsequent false positives. Through Click-based experiments, we show that the additional Bloom filter reduces the average table lookup time (i.e., from 120 ns to 93 ns) by handling most false positives within the fast memory.
Keywords:
Packet forwarding
bloom filter
additional filter
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.