32 search results - page 2 / 7 » False Negative Problem of Counting Bloom Filter |
SIGCOMM
2006
ACM
13 years 11 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
IM
2007
13 years 5 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...
PDCN
2007
13 years 6 months ago
2007
Packet classification continues to be an important challenge in network processing. It requires matching each packet against a database of rules and forwarding the packet accordi...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
—Bloom filters allow membership queries over sets with allowable errors. It is widely used in databases, networks and distributed systems and it has great potential for distribut...