17 search results - page 1 / 4 » The Variable-Increment Counting Bloom Filter |
INFOCOM
2012
IEEE
12 years 1 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...
ICON
2007
IEEE
14 years 5 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...
TKDE
2010
13 years 9 months ago
2010
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
ISLPED
2006
ACM
14 years 4 months ago
2006
ACM
—An increasing number of architectural techniques rely on hardware counting bloom filters (CBFs) to improve upon the enegy, delay and complexity of various processor structures. ...
ICWS
2009
IEEE
13 years 8 months ago
2009
IEEE
The Service registry, the yellow pages of ServiceOriented Architecture (SOA), plays a central role in SOAbased service systems. The service registry has to be scalable to manage l...