785 search results - page 5 / 157 » The Dynamic Bloom Filters |
ICON
2007
IEEE
14 years 1 months ago
2007
IEEE
— Within packet processing systems, lengthy memory accesses greatly reduce performance. To overcome this limitation, network processors utilize many different techniques, e.g., u...
IM
2007
13 years 7 months ago
2007
We consider the combination of two ideas from the hashing literature: the power of two choices and Bloom filters. Specifically, we show via simulations that, in comparison with a...
ALENEX
2011
12 years 11 months ago
2011
This paper presents an algorithm for exact pattern matching based on a new type of Bloom filter that we call a feed-forward Bloom filter. Besides filtering the input corpus, a ...
PERCOM
2004
ACM
14 years 7 months ago
2004
ACM
We describe a novel approach for content-based publish/subscribe system in mobile ad-hoc networks and show preliminary experiment results. We extended ODMRP (OnDemand Multicast Rou...
CJ
2002
13 years 7 months ago
2002
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...