Sciweavers

100 search results - page 3 / 20
» In-packet Bloom filters: Design and networking applications
Sort
View
SIGCOMM
2006
ACM
13 years 11 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
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 ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
ALENEX
2011
416views Algorithms» more  ALENEX 2011»
12 years 9 months ago
Exact Pattern Matching with Feed-Forward Bloom Filters
This paper presents an algorithm for exact pattern matching based on a new type of Bloom filter that we call a feed-forward Bloom filter. Besides filtering the input corpus, a ...
Iulian Moraru, David G. Andersen
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
13 years 6 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
TKDE
2010
184views more  TKDE 2010»
13 years 3 months ago
The Dynamic Bloom Filters
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan L...
ICC
2007
IEEE
109views Communications» more  ICC 2007»
13 years 11 months ago
A TCP Connection Establishment Filter: Symmetric Connection Detection
— Network measurement at 10+Gbps speeds imposes many restrictions on the resource consumption of the measurement application, making any filtering of input data highly desirable...
Brad Whitehead, Chung-Horng Lung, Peter Rabinovitc...