Sciweavers

98 search results - page 6 / 20
» Fast packet classification using bloom filters
Sort
View
SIGCOMM
1996
ACM
13 years 11 months ago
DPF: Fast, Flexible Message Demultiplexing Using Dynamic Code Generation
Fast and flexible message demultiplexing are well-established goals in the networking community [1, 18, 22]. Currently, however, network architects have had to sacrifice one for t...
Dawson R. Engler, M. Frans Kaashoek
ARCS
2006
Springer
13 years 11 months ago
Efficient System-on-Chip Energy Management with a Segmented Bloom Filter
As applications tend to grow more complex and use more memory, the demand for cache space increases. Thus embedded processors are inclined to use larger caches. Predicting a miss i...
Mrinmoy Ghosh, Emre Özer, Stuart Biles, Hsien...
INFOCOM
2012
IEEE
11 years 10 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
ACSAC
2006
IEEE
14 years 1 months ago
Enhancing Collaborative Spam Detection with Bloom Filters
Signature-based collaborative spam detection (SCSD) systems provide a promising solution addressing many problems facing statistical spam filters, the most widely adopted technol...
Jeff Yan, Pook Leong Cho