Sciweavers

17 search results - page 1 / 4
» The Variable-Increment Counting Bloom Filter
Sort
View
INFOCOM
2012
IEEE
11 years 7 months ago
The Variable-Increment Counting Bloom Filter
—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...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy
ICON
2007
IEEE
13 years 11 months ago
A Cache Architecture for Counting Bloom Filters
— Within packet processing systems, lengthy memory accesses greatly reduce performance. To overcome this limitation, network processors utilize many different techniques, e.g., u...
Mahmood Ahmadi, Stephan Wong
TKDE
2010
148views more  TKDE 2010»
13 years 3 months ago
False Negative Problem of Counting Bloom Filter
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
Deke Guo, Yunhao Liu, Xiang-Yang Li, Panlong Yang
ISLPED
2006
ACM
140views Hardware» more  ISLPED 2006»
13 years 10 months ago
L-CBF: a low-power, fast counting bloom filter architecture
—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. ...
Elham Safi, Andreas Moshovos, Andreas G. Veneris
ICWS
2009
IEEE
13 years 2 months ago
An Efficient Service Discovery Algorithm for Counting Bloom Filter-Based Service Registry
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...
Shuxing Cheng, Carl K. Chang, Liang-Jie Zhang