Sciweavers

25 search results - page 2 / 5
» Low complexity set reconciliation using Bloom filters
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
CSREASAM
2006
13 years 6 months ago
An Efficient Bloom Filter Based Solution for Multiparty Private Matching
- The issue of privacy becomes more and more important. On the other hand, online collaboration among different parties is almost unavoidable. How to allow collaboration while prot...
Pierre K. Y. Lai, Siu-Ming Yiu, K. P. Chow, C. F. ...
ISLPED
2006
ACM
140views Hardware» more  ISLPED 2006»
13 years 11 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
GLOBECOM
2007
IEEE
13 years 11 months ago
Aggregated Bloom Filters for Intrusion Detection and Prevention Hardware
—Bloom Filters (BFs) are fundamental building blocks in various network security applications, where packets from high-speed links are processed using state-of-the-art hardwareba...
N. Sertac Artan, Kaustubh Sinkar, Jalpa Patel, H. ...
INFOCOM
2008
IEEE
13 years 11 months ago
Algorithms for Low-Latency Remote File Synchronization
The remote file synchronization problem is how to update an outdated version of a file located on one machine to the current version located on another machine with a minimal am...
Hao Yan, Utku Irmak, Torsten Suel